# Last Day Where You Can Still Cross: Interview Notes
Last Day Where You Can Still Cross shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary search the day and Union-Find (or BFS) the unflooded cells, connecting a virtual top to a virtual bottom; the last feasible day is the answer.
## 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
Greedy walking around the latest flooded cell without checking a full top-to-bottom 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 undetectable AI interview copilot.