companyhub
DashboardCompaniesProblemsSheetsBookmarksRevisionsAnalyticsLeaderboardCompare
Settings
Sign in
DashboardCompaniesProblemsSheetsBookmarks
Medium

Minimum Cost Path with Edge Reversals

61.8% acceptance · asked by 8 companies

Solve on LeetCode
Heap (Priority Queue)Graph TheoryShortest Path

Workspace

Scratch, run, iterate — then submit on LeetCode

Custom input (stdin)

Console

Output appears here. Runs on the free Piston sandbox.

Your notes

Sign in to keep markdown notes on this problem — approach, complexity, gotchas.

Who asks this

Asana88Palantir63Oracle50Meta25Google25

Related problems

Top K Frequent Elements
Medium
Merge k Sorted Lists
Hard
Sliding Window Maximum
Hard
Kth Largest Element in an Array
Medium
Meeting Rooms II
Medium
Amazon25
Microsoft13
Bloomberg13