Tap here to switch tabs
Problem
Submissions

Problem: Split Array Largest Sum

Split Array Largest Sum divides an array of nonnegative numbers into k non-empty contiguous subarrays and asks for the smallest possible largest subarray sum.

Statement

Given an integer list nums and an integer k, split nums into k non-empty subarrays such that the largest sum among these subarrays is minimized. The task is to find the minimized largest sum by choosing the split such that the largest sum of every split of subarrays is the minimum among the sum of other splits.

Constraints:

  • 1≤1\leq nums.length ≤103\leq 10^3

  • 0≤0\leq nums[i] ≤104\leq 10^4

  • 1≤1\leq k ≤\leq nums.length

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Split Array Largest Sum

Split Array Largest Sum divides an array of nonnegative numbers into k non-empty contiguous subarrays and asks for the smallest possible largest subarray sum.

Statement

Given an integer list nums and an integer k, split nums into k non-empty subarrays such that the largest sum among these subarrays is minimized. The task is to find the minimized largest sum by choosing the split such that the largest sum of every split of subarrays is the minimum among the sum of other splits.

Constraints:

  • 1≤1\leq nums.length ≤103\leq 10^3

  • 0≤0\leq nums[i] ≤104\leq 10^4

  • 1≤1\leq k ≤\leq nums.length