Skip to content

Latest commit

 

History

History
72 lines (55 loc) · 5.36 KB

File metadata and controls

72 lines (55 loc) · 5.36 KB

BFS

Single-source BFS

Problem Difficulty
127. Word Ladder Hard
1091. Shortest Path in Binary Matrix Medium
433. Minimum Genetic Mutation Medium
1926. Nearest Exit from Entrance in Maze Medium (1638)
1129. Shortest Path with Alternating Colors Medium (1779)
**934. Shortest Bridge Medium (1825)
752. Open the Lock Medium (1877)
3552. Grid Teleportation Traversal Medium

Multi-Source BFS

Problem Difficulty Notes
**994. Rotting Oranges Medium
**542. 01 Matrix Medium Distance matrix, no visited set needed. OR 2-pass DP.
1162. As Far from Land as Possible Medium (1666)

Multi-State BFS

Problem Difficulty
**1293. Shortest Path in a Grid with Obstacles Elimination Hard (1967)
3568. Minimum Moves to Clean the Classroom Hard

Single-Source Shortest Path (SSSP)

Problem Difficulty
743. Network Delay Time Medium
787. Cheapest Flights Within K Stops Medium
1631. Path With Minimum Effort Medium (1947)

Shortest Path Faster Algorithm (SPFA)

TODO: Check if the problem type is correct and these problems are in the right category.

Problem Difficulty
1514. Path with Maximum Probability Medium

Dijkstra's Algorithm

Problem Difficulty
743. Network Delay Time Medium
1631. Path With Minimum Effort Medium (1947)
1514. Path with Maximum Probability Medium
3286. Find a Safe Walk Through a Grid Medium

TODO: Add problem listing https://leetcode.com/discuss/post/7322154/10-dijkstra-variations-for-interview-pre-s8by/