Available question text
Find the minimum time to reach node n-1 from node 0 in a directed temporal graph where each edge can be traversed in one unit only at integer times within a given [start,end] window and you may wait at nodes; return -1 if unreachable.
Core challenge: shortest-path in a temporal graph — scheduling departures (or waiting) to match edge availability windows.
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 3604. Minimum Time to Reach Destination in Directed Graph
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source