Leetcode 743. Network Delay Time
Given a directed, nonnegative-weighted graph and a start node k, compute single-source shortest-path distances and return the maximum distance (the time for the signal to reach all nodes) or -1 if any node is unreachable; weights are nonnegative so Dijkstra is applicable.
Asked at:
CrowdStrike
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late April, 2026
CrowdStrike
Mid-level
Network Delay Time. Simple Dijikstra.
Hello Interview Premium
Your account is free and you can post anonymously if you choose.