BackmediumUncategorized uncategorized medium

Minimum Maximum Subarray Sum Solution

Problem Statement

Given an integer array `volumes` and an integer `k`, partition the array into `k` non-empty contiguous subarrays. The score of each partition is the sum of its elements. Your goal is to minimize the maximum score among all `k` subarrays. Return the minimum possible maximum subarray sum after partitioning.

Example 1

Input

volumes = [7, 2, 5, 10, 8], k = 2

Output

undefined

Explanation: We can partition the array into [7, 2, 5] and [10, 8]. The sums of these subarrays are 14 and 18 respectively. The maximum of these is 18, which is the minimum possible.

Constraints

1 <= volumes.length <= 10^5
1 <= volumes[i] <= 10^5
1 <= k <= volumes.length

Minimum Maximum Subarray Sum Solution

Problem Statement

Input

Output

Constraints

More Uncategorized Problems

Optimized Approach

Step-by-Step Dry Run

Tested Solutions