# Design An ATM Machine: Explained
Design An ATM Machine shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Store counts of 20/50/100/200/500. For a withdrawal, greedy from largest to smallest without exceeding remaining notes; only commit if you can make the exact amount.
## 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(1).
## Common mistake
Greedy without a dry-run, so a failed withdrawal still removes notes.
## 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 here.