# Find Minimum Time To Reach Room II: Study Guide
Find Minimum Time To Reach Room II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Like room I, but alternate move costs 1,2,1,2,... depending on how many moves you have made (or the parity of the step). Dijkstra state can stay (r,c) if the step parity is determined by time, or (r,c,parity). Arrival is max(time, moveTime[nr][nc]) + step_cost.
## 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
Using a constant +1 move cost, or putting parity into the wrong place so a cell is frozen at the first (possibly worse-parity) visit.
## 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 interview copilot app.