# Network Delay Time: Walkthrough
Network Delay Time shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Dijkstra (or a heap BFS) from the source on the directed weighted graph; the answer is the max distance among reachable nodes, or -1 if any node is left at inf.
## 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
Running an unweighted BFS and treating every edge as cost 1, which ignores longer-but-cheaper routes.
## 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 AI.