# Network Delay Time with Dijkstra Heap (Practice 5071): Review

Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.

## Approach

Lazy-deletion Dijkstra; the answer is the max shortest distance, or -1 if a node is unreachable.

```python
import heapq
def network_delay(times,n,k):
g={}
for u,v,w in times: g.setdefault(u,[]).append((v,w))
dist={};h=[(0,k)]
while h:
d,u=heapq.heappop(h)
if u in dist: continue
dist[u]=d
for v,w in g.get(u,[]): heapq.heappush(h,(d+w,v))
return max(dist.values()) if len(dist)==n else -1
```

## Complexity

Linear in the dominant input size for the scan; heap/tree variants add a log factor.

## Interview pitfalls

State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.

## Practicing out loud

Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see Linkjob AI interview assistant.