# Number Of Visible People In A Queue: Walkthrough
Number Of Visible People In A Queue shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A monotonic decreasing stack of heights from right to left. Everyone you pop is visible to the current person, and the first remaining taller person (if any) is also visible; then push the current height.
## 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
Counting anyone shorter to the right, which ignores that a taller person in the middle blocks the view.
## 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.