Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3112. Minimum Time to Visit Disappearing Nodes
Find the minimum travel time from node 0 to every node in a weighted undirected graph under the constraint that each node must be reached strictly before its given disappear time (otherwise it's unreachable); return -1 for nodes that can't be visited. This is essentially a shortest-path problem with per-node time-window availability.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.