Split Array Largest Sum
Hard📝 Description
Minimize largest sum when splitting array into m subarrays
Input Format
First line: space-separated array Second line: m
Output Format
Minimized largest sum
Constraints
1 ≤ m ≤ nums.length ≤ 1000
🔍 Sample Input
7 2 5 10 8
2
✅ Sample Output
18
Code Editor
Please login to run and submit code.
Results
Suggested Solution
Shortcuts: Ctrl+Enter to submit, Ctrl+Shift+R to run