# 132 Pattern: Study Guide
132 Pattern shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Scan from the right keeping a monotonic stack of candidates for ak (the '2'); track the largest popped value as ak, and return true if nums[i] < ak.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Looking only for any i
## 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 official website.