Split Array Largest Sum

Split an array of non-negative integers into k non-empty contiguous subarrays so that the largest subarray sum is as small as possible. Print that minimum largest sum.

1 <= k <= n <= 1000 0 <= nums[i] <= 10^6