# Trapping Rain Water II: Interview Notes
Trapping Rain Water II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Min-heap boundary BFS: pop the lowest rim cell and push unseen neighbors, trapping max(0, height-neighbor) as the water line only rises.
## 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 log(mn)).
## Common mistake
Running the 1-D two-pointer independently on every row and column and adding them, which double-counts or misses 2-D leaks.
## 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 Linkjob AI interview assistant.