#1787Medium#17 in LinkedIn's list· asked at 23 companies
Split array - largest sum
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: nums = [7,2,5,10,8], k = 2 Output: 18
Split into [7,2,5] and [10,8].
Example 2
Input: nums = [1,2,3,4,5], k = 2 Output: 9
Split into [1,2,3] and [4,5].
Constraints
- •
1 <= nums.length <= 1000 - •
0 <= nums[i] <= 10^6 - •
1 <= k <= min(50, nums.length)