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.