Split array largest sum
Filed under Tekion
The question
Given an array of integers and an integer m, split the array into m non-empty contiguous subarrays such that the largest sum among these subarrays is minimized.
No write-up yet. Related questions below have one.
Related Tekion questions
Collected from public candidate posts and coding forums. Updated Nov 2026.