## Split Array Largest Sum

Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.

Input: `[7,2,5,10,8], 2`

Output: `18`

### Try it yourself

Loading full content...