# CFA2 Pushdown Analysis: Walkthrough
CFA2 Pushdown Analysis shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Model the unbounded call stack with a pushdown system so returns flow to the matching call site even without a finite k contour.
## 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
More precise than k-CFA on recursive higher-order programs; cost is that of a pushdown reachability query.
## Common mistake
Popping the stack on a return without checking that the frame belongs to the same call, which is exactly the k-CFA merging bug CFA2 avoids.
## 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 the Linkjob AI app.