Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
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 3112. Minimum Time to Visit Disappearing Nodes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source