# Number Of Subarrays With Bounded Maximum: Practice Notes

Number Of Subarrays With Bounded Maximum shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Count subarrays whose max is <= right, minus those whose max is <= left-1, by walking the most recent out-of-range index.

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

Enumerating every subarray and scanning for its max.

## 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 real-time interview help.