3650. Minimum Cost Path with Edge Reversals
MediumGraph Theory · Heap (Priority Queue) · Shortest Path · 15:57
LeetCode problem 3650, Minimum Cost Path with Edge Reversals, was LeetCode's Daily Challenge on Tuesday, January 27, 2026. It's rated medium. codestorywithMIK explains the approach step by step in the video above.