# Sum Of Subarray Minimums: Study Guide

Sum Of Subarray Minimums shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

For each value find the previous and next strictly smaller bounds (monotonic stack) so it is the minimum of left*right subarrays, then sum value*left*right.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Computing min of every subarray in O(n^2).

## 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.