CodingMediumcod-g263

Subject Dp optimizationLevel Mid–Senior~30 minCommon in Distributed systems · Algorithms & data structures interviewsIndustries Software development

Question

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) → int

Examples

in[[7,2,5,10,8],2]out18

What 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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.