15% off all plans & roadmaps Use code
See plans
Preparing this workspace.
LeetCode 410 · Solution & editorial
Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized.
Split Array Largest Sum is a Binary Search Patterns problem, in the On Answer / Condition Function subpattern. The pattern covers standard binary search, rotated arrays, first/last occurrence, and search on answer space
Learn binary search on answer space for optimization problems like Koko eating bananas and capacity to ship packages.
The reference solution runs in O(nlogs) time and O(1) space.
Split Array Largest Sum has been reported in interviews at Amazon, Google.
The full editorial is part of Pro
It explains the core insight, the complexity analysis and the common mistakes, with a worked solution.
Split Array Largest Sum is a Binary Search Patterns problem, in the On Answer / Condition Function subpattern. Once the approach above makes sense, write it yourself and then work through the neighbouring problems that reuse it.