# Champagne Tower: Explained
Champagne Tower shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Simulate flow row by row: each glass keeps up to 1 and splits the overflow equally to the two glasses below. Clamp the queried glass to 1.
## 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(row^2).
## Common mistake
Using a closed-form binomial guess, or forgetting to clamp at 1.
## 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 www.linkjob.ai.