Available question text
Find a path from city 0 to city n-1 in an undirected graph where edges have travel times and each node has a passing fee, minimizing the sum of node fees while keeping total travel time ≤ maxTime (return -1 if impossible). This is a constrained shortest-path problem that requires exploring time as an extra state (e.g., DP/Dijkstra over (node, time)).
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 1928. Minimum Cost to Reach Destination in Time
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source