LeetCode
Experience
#1368 Minimum Cost to Make at Least One Valid Path in a Grid
Interview Experience
LeetCode #1368: Minimum Cost to Make at Least One Valid Path in a Grid. Difficulty: Hard. Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path. Asked at Google 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
Breadth-First Search
Graph Theory
Heap (Priority Queue)
Shortest Path
Arrays
Graph
Heap
Matrix
Queue