| Status | Title | Video | Leetcode | Solve | Difficulty | Companies | Topics |
|---|---|---|---|---|---|---|---|
| 499. The Maze III | Solve | Hard | Google | ||||
| 882. Reachable Nodes In Subdivided Graph | Solve | Hard | - | ||||
| 1368. Minimum Cost to Make at Least One Valid Path in a Grid | Solve | Hard | Google | ||||
| 2045. Second Minimum Time to Reach Destination | Solve | Hard | - | ||||
| 2203. Minimum Weighted Subgraph With the Required Paths | Solve | Hard | Google | ||||
| 2290. Minimum Obstacle Removal to Reach Corner | Solve | Hard | Google | ||||
| 2577. Minimum Time to Visit a Cell In a Grid | Solve | Hard | Atlassian | ||||
| 2642. Design Graph With Shortest Path Calculator | Solve | Hard | Samsung | ||||
| 2699. Modify Graph Edge Weights | Solve | Hard | - | ||||
| 2714. Find Shortest Path with K Hops | Solve | Hard | - | ||||
| 2959. Number of Possible Sets of Closing Branches | Solve | Hard | Atlassian+2 | ||||
| 2977. Minimum Cost to Convert String II | Solve | Hard | Atlassian | ||||
| 3123. Find Edges in Shortest Paths | Solve | Hard | - |