Add solution #2551

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,080 LeetCode solutions in JavaScript
+# 1,081 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -1011,6 +1011,7 @@
 2529|[Maximum Count of Positive Integer and Negative Integer](./solutions/2529-maximum-count-of-positive-integer-and-negative-integer.js)|Easy|
 2535|[Difference Between Element Sum and Digit Sum of an Array](./solutions/2535-difference-between-element-sum-and-digit-sum-of-an-array.js)|Easy|
 2542|[Maximum Subsequence Score](./solutions/2542-maximum-subsequence-score.js)|Medium|
+2551|[Put Marbles in Bags](./solutions/2551-put-marbles-in-bags.js)|Hard|
 2559|[Count Vowel Strings in Ranges](./solutions/2559-count-vowel-strings-in-ranges.js)|Medium|
 2560|[House Robber IV](./solutions/2560-house-robber-iv.js)|Medium|
 2570|[Merge Two 2D Arrays by Summing Values](./solutions/2570-merge-two-2d-arrays-by-summing-values.js)|Easy|

solutions/2551-put-marbles-in-bags.js

@@ -0,0 +1,46 @@
+/**
+ * 2551. Put Marbles in Bags
+ * https://leetcode.com/problems/put-marbles-in-bags/
+ * Difficulty: Hard
+ *
+ * You have k bags. You are given a 0-indexed integer array weights where weights[i] is the weight
+ * of the ith marble. You are also given the integer k.
+ *
+ * Divide the marbles into the k bags according to the following rules:
+ * - No bag is empty.
+ * - If the ith marble and jth marble are in a bag, then all marbles with an index between the ith
+ *   and jth indices should also be in that same bag.
+ * - If a bag consists of all the marbles with an index from i to j inclusively, then the cost of
+ *   the bag is weights[i] + weights[j].
+ *
+ * The score after distributing the marbles is the sum of the costs of all the k bags.
+ *
+ * Return the difference between the maximum and minimum scores among marble distributions.
+ */
+
+/**
+ * @param {number[]} weights
+ * @param {number} k
+ * @return {number}
+ */
+var putMarbles = function(weights, k) {
+  const n = weights.length;
+  if (k === n) return 0;
+
+  const pairSums = [];
+  for (let i = 0; i < n - 1; i++) {
+    pairSums.push(weights[i] + weights[i + 1]);
+  }
+
+  pairSums.sort((a, b) => a - b);
+
+  let minScore = 0;
+  let maxScore = 0;
+
+  for (let i = 0; i < k - 1; i++) {
+    minScore += pairSums[i];
+    maxScore += pairSums[n - 2 - i];
+  }
+
+  return maxScore - minScore;
+};