Add solution #1300

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,215 LeetCode solutions in JavaScript
+# 1,216 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -983,6 +983,7 @@
 1297|[Maximum Number of Occurrences of a Substring](./solutions/1297-maximum-number-of-occurrences-of-a-substring.js)|Medium|
 1298|[Maximum Candies You Can Get from Boxes](./solutions/1298-maximum-candies-you-can-get-from-boxes.js)|Hard|
 1299|[Replace Elements with Greatest Element on Right Side](./solutions/1299-replace-elements-with-greatest-element-on-right-side.js)|Easy|
+1300|[Sum of Mutated Array Closest to Target](./solutions/1300-sum-of-mutated-array-closest-to-target.js)|Medium|
 1304|[Find N Unique Integers Sum up to Zero](./solutions/1304-find-n-unique-integers-sum-up-to-zero.js)|Easy|
 1309|[Decrypt String from Alphabet to Integer Mapping](./solutions/1309-decrypt-string-from-alphabet-to-integer-mapping.js)|Easy|
 1313|[Decompress Run-Length Encoded List](./solutions/1313-decompress-run-length-encoded-list.js)|Easy|

solutions/1300-sum-of-mutated-array-closest-to-target.js

@@ -0,0 +1,42 @@
+/**
+ * 1300. Sum of Mutated Array Closest to Target
+ * https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/
+ * Difficulty: Medium
+ *
+ * Given an integer array arr and a target value target, return the integer value such that when
+ * we change all the integers larger than value in the given array to be equal to value, the
+ * sum of the array gets as close as possible (in absolute difference) to target.
+ *
+ * In case of a tie, return the minimum such integer.
+ *
+ * Notice that the answer is not neccesarilly a number from arr.
+ */
+
+/**
+ * @param {number[]} arr
+ * @param {number} target
+ * @return {number}
+ */
+var findBestValue = function(arr, target) {
+  arr.sort((a, b) => a - b);
+  let prefixSum = 0;
+  const length = arr.length;
+
+  for (let i = 0; i < length; i++) {
+    const remaining = length - i;
+    const avg = (target - prefixSum) / remaining;
+
+    if (avg <= arr[i]) {
+      const floorVal = Math.floor(avg);
+      const ceilVal = Math.ceil(avg);
+      const floorSum = prefixSum + floorVal * remaining;
+      const ceilSum = prefixSum + ceilVal * remaining;
+
+      return Math.abs(floorSum - target) <= Math.abs(ceilSum - target) ? floorVal : ceilVal;
+    }
+
+    prefixSum += arr[i];
+  }
+
+  return arr[length - 1];
+};