Leetcode 3604. Minimum Time to Reach Destination in Directed Graph

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.