410. Split Array Largest Sum
Problem Statement
Given an integer array nums
and an integer k
, split nums
into k
non-empty subarrays such that the largest sum of any subarray is minimized.
Return the minimized largest sum of the split.
A subarray is a contiguous part of the array.
Example 1:
Example 2:
Constraints:
1 <= nums.length <= 1000
0 <= nums[i] <= 106
1 <= k <= min(50, nums.length)
Intuition
Links
https://leetcode.com/problems/split-array-largest-sum/description/
Video Links
https://www.youtube.com/watch?v=thUd_WJn6wk&ab_channel=takeUforward
Approach 1:
C++
Approach 2:
C++
Approach 3:
C++
Approach 4:
C++
Similar Problems
Last updated