Binary Search/Split Array Largest SumHard

This practice workspace is built for desktop. Open it on a larger screen to start solving.

Split Array Largest Sum

Binary Search·Hard

Given an integer array nums and an integer k, split nums into k non-empty contiguous subarrays such that the largest subarray sum is minimized.

Return the minimized largest sum of the split.

Examples

Input: nums = [7,2,5,10,8], k = 2

Output: 18

The best way is to split into [7,2,5] and [10,8], where the largest sum is 18.

Input: nums = [1,2,3,4,5], k = 2

Output: 9

Split into [1,2,3] and [4,5]. Largest sum is 9.

Input: nums = [1,4,4], k = 3

Output: 4

Each element forms its own subarray. Largest sum is 4.

Constraints

1 <= nums.length <= 1000
0 <= nums[i] <= 10^6
1 <= k <= min(50, nums.length)

00:00Preview Mode (Read Only)

Loading editor…

Tests

Preview Mode

This is a read-only preview of DSAMind's AI coaching. Sign up to get custom feedback on your own solution.

Passed32 ms

First attempt — retry to track metric movement here.

Your approach

Pattern:Binary Search
Time:O(N)
Space:O(1)

Complete approach — pattern and complexity both named.

Coach

What you got right

You correctly matched the sorted input requirement and implemented a linear-time scan using two pointers.

Where it diverged

No divergence detected. The code correctly aligns with the stated approach.

Next attempt: focus on

Try solving related sliding window problems to build familiarity with two-pointer variants.

Signals

No signals fired — clean run, you stayed in flow.