# Swim In Rising Water: Explained
Swim In Rising Water shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You can enter a cell at time t only if grid[i][j] <= t, and t must be at least the max height seen so far. Binary-search t plus BFS, or Dijkstra/priority-BFS where the key is the max height on the path; the answer is that key at n-1,n-1.
## 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^2 log n).
## Common mistake
A plain Manhattan wait-time without searching an actual path, which ignores that you may have to climb a taller cell to get around.
## 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 here.