# Find Minimum Time To Reach Room I: Interview Notes
Find Minimum Time To Reach Room I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Move through a grid; entering room (i,j) cannot happen before moveTime[i][j], and each move takes 1 second. Dijkstra on (r,c) with cost max(current_time, moveTime[nr][nc]) + 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(mn log mn).
## Common mistake
BFS without considering wait time, or adding moveTime instead of waiting until that timestamp then +1.
## 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 this tool.