# Sum Of Subarray Ranges: Study Guide
Sum Of Subarray Ranges shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
range(subarray) = max - min, and we want the sum over every subarray. Two monotonic-stack passes compute each element’s contribution as a max and as a min (count of subarrays where it is the strict extremum, times its value) and subtract.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Enumerating every subarray and scanning for min/max (O(n^2) or O(n^3)), which TLEs on n=1e5.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at best AI tool for coding tests and OAs.