Split array minimize maximum load
Split the array nums into at most k non-empty contiguous subarrays. The 'load' of a split is the largest subarray sum. Return the minimum possible load. 1 <= len(nums) <= 1000, 1 <= k <= len(nums), 0 <= nums[i] <= 10^6.
Implement
min_largest_split(nums: list[int], k: int) → intExamples
in
[[7,2,5,10,8],2]out18What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[[7,2,5,10,8],2]18not run yetsample