# Bricks Falling When Hit: Study Guide
Bricks Falling When Hit shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Process hits in reverse: erase them first, Union-Find the remaining grid plus a virtual roof, then add each hit back and count how many bricks newly connect to the roof.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(mn α(mn)).
## Common mistake
Simulating each hit forward with a flood fill from scratch, which TLEs, or dropping a brick that is still held up through another path.
## 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 AI job interview answers in real time.