# Falling Squares: Practice Notes
Falling Squares shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each new square lands at height = side + the max height of any already-placed interval that overlaps left, left+side). Record that new interval height (a list of intervals or a segment tree) and track the running global max as the skyline query.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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^2) with a list, O(n log n) with a tree.
## Common mistake
Only comparing with the immediately previous square and missing an earlier taller overlap.
## 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 [https://www.linkjob.ai/.