Given an integer array arr, compute the sum of the minimum values across every contiguous subarray of arr. Since the result may be very large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ arr.length $\leq 3 \times 10^4$

• $1 \leq$ arr[i] $\leq 3 \times 10^4$

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.