# Avoid Flood In The City: Practice Notes
Avoid Flood In The City shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
rains[i]=0 is a dry day you assign to a full lake; rains[i]>0 fills that lake and floods if it is already full. Keep full lakes and a sorted set of dry days; when a lake would flood, dry it on the earliest dry day after it last filled.
## 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(n log n).
## Common mistake
Assigning an arbitrary future dry day, which can leave an earlier flood unpreventable.
## 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 multilingual AI interview assistant.