410. Split Array Largest Sum
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:
Input: nums = [7,2,5,10,8], k = 2 Output: 18 Explanation: There are four ways to split nums into two subarrays. The best way is to split it into [7,2,5] and [10,8], where the largest sum among the two subarrays is only 18.
Example 2:
Input: nums = [1,2,3,4,5], k = 2 Output: 9 Explanation: There are four ways to split nums into two subarrays. The best way is to split it into [1,2,3] and [4,5], where the largest sum among the two subarrays is only 9.
Constraints:
1 <= nums.length <= 10000 <= nums[i] <= 1061 <= k <= min(50, nums.length)
Asked at 20 companies
Google
Infosys
DeloitteTopics
Similar problems
Capacity To Ship Packages Within D DaysMediumDivide ChocolateHardFair Distribution of CookiesMediumSubsequence of Size K With the Largest Even SumMediumMaximum Total Beauty of the GardensHardNumber of Ways to Split ArrayMediumMinimum Cost to Split an ArrayHardDistribute Elements Into Two Arrays IEasyLoading editor…
1class Solution:
2 def splitArray(self, nums: List[int], k: int) -> int:
3
Starter codePython 3Spaces: 4
Loading editor…
1class Solution:
2 def splitArray(self, nums: List[int], k: int) -> int:
3
Starter codePython 3Spaces: 4
Examples
Input
[7,2,5,10,8] 2
Input
[1,2,3,4,5] 2
Your code is saved on this device.Solution