Leetcode 2039. The Time When the Network Becomes Idle

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2039. The Time When the Network Becomes Idle

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact