Available question text
Find the minimum cost to travel from node 0 to node n-1 in a weighted directed graph where each node can, at most once upon arrival, flip one of its incoming edges and immediately traverse that reversed edge at double its weight; return -1 if the destination is unreachable.
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 3650. Minimum Cost Path with Edge Reversals
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source