hardArrayMathMonotonic StackStack 0 views

Maximum and Minimum Sums of at Most Size K Subarrays

You are given an integer array nums and a positive integer k.

You are given an integer array nums and a positive integer k. Return the sum of the maximum and minimum elements of all subarrays with at most k elements.

Maximum and Minimum Sums of at Most Size K Subarrays diagram

Example 1

Input: nums = [1,2,3], k = 2

Output: 20

Explanation: The subarrays of nums with at most 2 elements are: The output would be 20.

Example 2

Input: nums = [1,-3,1], k = 2

Output: -6

Explanation: The subarrays of nums with at most 2 elements are: The output would be -6.

Constraints

1 <= nums.length <= 80000
1 <= k <= nums.length
-10^6 <= nums[i] <= 10^6

Hints

Companies

No companies reported yet.

Discussion

Loading discussion...

class Solution {
    public long minMaxSubarraySum(int[] nums, int k) {
        
    }
}

Test results

No test cases yet.