# Second Minimum Time To Reach Destination: Explained
Second Minimum Time To Reach Destination shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS/Dijkstra that tracks the first and second distinct arrival times at each node, because you may need to wait for the traffic light parity; return the second time you reach n.
## 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(E log V).
## Common mistake
Plain Dijkstra that only keeps the earliest arrival and therefore never sees the second-min 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 Linkjob.