Split array largest sum
Given an integer array nums and an integer k, split nums into exactly k non-empty CONTIGUOUS subarrays. Minimize the largest sum among the k subarrays, and return that minimized largest sum. Constraints: 1 <= k <= len(nums) <= 1000, 0 <= nums[i] <= 10^6.
Implement
split_array_min_largest_sum(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 32 min
solution.py
InputExpectedGot
[[7,2,5,10,8],2]18not run yetsample