Split an integer array into exactly k non-empty contiguous subarrays so that the largest subarray sum is as small as possible, and return that sum.
Loading content...