DFS Path Finding Problems
10 DFS Path Finding problems on LeetCode, a Graphs interview pattern, ranked by importance (how often it comes up in real interviews). Difficulty (ELO) and importance shown per problem.
| # | PROBLEM | DIFF | ELO | IMP | PATTERNS |
|---|---|---|---|---|---|
| 1 | Longest Increasing Path in a Matrix | Hard | 1928 | 88 | Grid Path Problems · Topological Sort |
| 2 | Evaluate Division | Medium | 1597 | 82 | Union-Find · BFS Shortest Path (Unweighted) |
| 3 | Reconstruct Itinerary | Hard | 1857 | 73 | Heap Simulation · Sorting + Comparison |
| 4 | Restore the Array From Adjacent Pairs | Medium | 1579 | 55 | Frequency Counting / Hash Map Lookup |
| 5 | All Paths from Source Lead to DestinationPREMIUM | Medium | 1628 | 52 | Topological Sort |
MORE GRAPHS PATTERNS
// your mastery
What's your DFS Path Finding tier?
leaps.gg syncs your LeetCode history, scores your DFS Path Finding mastery, and recommends exactly which problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →