Search⌘ K
AI Features

Solution: Put Marbles in Bags

Solution: Put Marbles in Bags splits a weight array into k nonempty contiguous bags. Return the difference between the greatest and least possible scores, based on each bag's endpoint weights.

Statement

You are given k bags and a 0-indexed integer array, weights, where weights[i] represents the weight of the ithi^{th} marble.

Your task is to divide the marbles into the k bags according to the following rules:

  1. No bag can be empty.

  2. If the ...