LeetCode
Experience
#3650 Minimum Cost Path with Edge Reversals
Interview Experience
LeetCode #3650: Minimum Cost Path with Edge Reversals. Difficulty: Medium. Topics: Graph Theory, Heap (Priority Queue), Shortest Path. Asked at Oracle in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Graph Theory
Heap (Priority Queue)
Shortest Path
Graph
Heap
Queue
More from Oracle
1p3a
Oracle Software Engineer 3 Technical Interview, 6 YOE, Rejected, Q3 2025
1p3a
Oracle OCI SMTS Interview Experience with 5 YOE System Design and Coding
1p3a
Oracle OCI IC3 Software Engineer Interview Experience Networking Team
1p3a
Oracle Senior Application Developer Interview Questions and Experience
1p3a
Oracle Senior Software Engineer Technical Phone Interview Throttling Design