Available question text
Compute shortest distances from the master (node 0) with a BFS to get each server's round-trip time (2*d), then for each server use its patience to determine the time its final reply arrives (after repeated resends) and return the maximum of those times plus one as the earliest second the network is idle.
Related questions
Continue with questions that share topics or the same question type.
- Network Delay Time
Coding · Breadth-First Search · Depth-First Search · Dijkstra's Algorithm
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- Aggregate Two Time Series
Coding · Array · Two Pointers
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2039. The Time When the Network Becomes Idle
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source