# Count Subarrays With Fixed Bounds: Interview Notes
Count Subarrays With Fixed Bounds shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Slide through the array and track the last index of minK, maxK, and a value outside [minK, maxK]. Each right end adds max(0, min(last_min, last_max) - last_out).
## 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
Requiring both bounds to sit at the ends of the window.
## 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 Linkjob AI interview assistant.