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

Calculate the sum of the minimum and maximum values of all contiguous subarrays of nums that have a size of at most k.

Return the sum of the minimum and maximum elements across all such subarrays.

Constraints:

• $1 \leq$ nums.length $\leq 80000$

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

• $-10^6 \leq$ nums[i] $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.