Leetcode 2104. Sum of Subarray Ranges

Compute the sum of (maximum - minimum) over all contiguous subarrays of a given integer array. The challenge is to do this faster than brute force by counting each element's contribution as subarray maximum and minimum (can be achieved in O(n) with monotonic-stack techniques).