Add solution #410

Author: JoshCrozier

README.md

@@ -327,6 +327,7 @@
 406|[Queue Reconstruction by Height](./0406-queue-reconstruction-by-height.js)|Medium|
 407|[Trapping Rain Water II](./0407-trapping-rain-water-ii.js)|Hard|
 409|[Longest Palindrome](./0409-longest-palindrome.js)|Easy|
+410|[Split Array Largest Sum](./0410-split-array-largest-sum.js)|Hard|
 412|[Fizz Buzz](./0412-fizz-buzz.js)|Easy|
 414|[Third Maximum Number](./0414-third-maximum-number.js)|Easy|
 415|[Add Strings](./0415-add-strings.js)|Easy|

solutions/0410-split-array-largest-sum.js

@@ -0,0 +1,45 @@
+/**
+ * 410. Split Array Largest Sum
+ * https://leetcode.com/problems/split-array-largest-sum/
+ * Difficulty: Hard
+ *
+ * Given an integer array nums and an integer k, split nums into k non-empty subarrays
+ * such that the largest sum of any subarray is minimized.
+ *
+ * Return the minimized largest sum of the split.
+ *
+ * A subarray is a contiguous part of the array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var splitArray = function(nums, k) {
+  let left = Math.max(...nums);
+  let right = nums.reduce((a, b) => a + b);
+
+  while (left < right) {
+    const mid = Math.floor((left + right) / 2);
+    let count = 1;
+    let sum = 0;
+
+    for (const num of nums) {
+      if (sum + num <= mid) {
+        sum += num;
+      } else {
+        count++;
+        sum = num;
+      }
+    }
+
+    if (count > k) {
+      left = mid + 1;
+    } else {
+      right = mid;
+    }
+  }
+
+  return left;
+};