Split Array Largest Sum · Coding Interview Practice

Split Array Largest SumGiven an integer array and an integer k, split the array into k non-empty contiguous subarrays so that the largest sum among them is as small as possible. Return that minimized largest sum.Constraints

1 <= nums.length <= 1000

0 <= nums[i] <= 10^6

1 <= k <= min(50, nums.length)

Examples

Input: nums = [7, 2, 5, 10, 8], k = 2 Output: 18

Input: nums = [1, 2, 3, 4, 5], k = 2 Output: 9

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…