Time: 2 ms (32.4%), Space: 42.4 MB (99.08%) - LeetHub

Author: MukulParasar

0410-split-array-largest-sum/0410-split-array-largest-sum.java

@@ -0,0 +1,29 @@
+class Solution {
+    public int splitArray(int[] nums, int k) {
+        int start = 0;
+        int end = 0;
+        for (int i = 0; i < nums.length; i++) {
+            start = Math.max(start, nums[i]);
+            end += nums[i];
+        }
+        while (start < end) {
+            int mid = start + (end - start) / 2;
+            int sum = 0;
+            int pieces = 1;
+            for (int num : nums) {
+                if (sum + num > mid) {
+                    sum = num;
+                    pieces++;
+                } else {
+                    sum += num;
+                }
+            }
+            if (pieces <= k) {
+                end = mid;
+            } else {
+                start = mid + 1;
+            }
+        }
+        return end;
+    }
+}