Leetcode 907. Sum of Subarray Minimums

Compute the sum of the minimum element of every contiguous subarray of arr, returned modulo 10^9+7. Because n can be up to 3·10^4, the intended approach counts how many subarrays each element is the minimum (a monotonic-stack previous/next-smaller pattern) to achieve O(n) time.