Split array into K sub-arrays to minimize max sum
Filed under Cimpress
The question
Given an array of numbers and an integer K, partition the array into K contiguous sub-arrays such that the maximum sum among all sub-arrays is minimized.
No write-up yet. Related questions below have one.
Related Cimpress questions
Collected from public candidate posts and coding forums. Updated Nov 2026.