Leetcode 3650. Minimum Cost Path with Edge Reversals
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.