Phase | Topic | Difficulty | Problem Title | Platform | Link |
---|---|---|---|---|---|
1 | Graph Basics & Traversals | Easy | DFS of Graph | GFG | https://practice.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1 |
1 | Graph Basics & Traversals | Easy | BFS of Graph | GFG | https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1 |
1 | Graph Basics & Traversals | Easy | Flood Fill | LeetCode | https://leetcode.com/problems/flood-fill/ |
1 | Graph Basics & Traversals | Easy | The Maze | LeetCode | https://leetcode.com/problems/the-maze/ |
1 | Graph Basics & Traversals | Medium | Number of Provinces | LeetCode | https://leetcode.com/problems/number-of-provinces/ |
1 | Graph Basics & Traversals | Medium | Rotting Oranges | LeetCode | https://leetcode.com/problems/rotting-oranges/ |
1 | Graph Basics & Traversals | Medium | Walls and Gates | LeetCode | https://leetcode.com/problems/walls-and-gates/ |
1 | Graph Basics & Traversals | Medium | Shortest Path in Binary Matrix | LeetCode | https://leetcode.com/problems/shortest-path-in-binary-matrix/ |
1 | Graph Basics & Traversals | Hard | Cut Off Trees | LeetCode | https://leetcode.com/problems/cut-off-trees-for-golf-event/ |
1 | Graph Basics & Traversals | Hard | The Maze III | LeetCode | https://leetcode.com/problems/the-maze-iii/ |
2 | Connected Components | Easy | Number of Islands | LeetCode | https://leetcode.com/problems/number-of-islands/ |
2 | Connected Components | Easy | Max Area of Island | LeetCode | https://leetcode.com/problems/max-area-of-island/ |
2 | Connected Components | Easy | Find the Town Judge | LeetCode | https://leetcode.com/problems/find-the-town-judge/ |
2 | Connected Components | Easy | Find Center of Star Graph | LeetCode | https://leetcode.com/problems/find-center-of-star-graph/ |
2 | Connected Components | Medium | Count Connected Components | LeetCode | https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/ |
2 | Connected Components | Medium | Surrounded Regions | LeetCode | https://leetcode.com/problems/surrounded-regions/ |
2 | Connected Components | Medium | Pacific Atlantic Water Flow | LeetCode | https://leetcode.com/problems/pacific-atlantic-water-flow/ |
2 | Connected Components | Medium | Color Border | LeetCode | https://leetcode.com/problems/coloring-a-border/ |
2 | Connected Components | Hard | Number of Distinct Islands II | LeetCode | https://leetcode.com/problems/number-of-distinct-islands-ii/ |
2 | Connected Components | Hard | Remove Max Edges to Keep Graph Traversable | LeetCode | https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/ |
3 | Cycle Detection | Easy | Find if Path Exists in Graph | LeetCode | https://leetcode.com/problems/find-if-path-exists-in-graph/ |
3 | Cycle Detection | Easy | Path Exists in Graph | LeetCode | https://leetcode.com/problems/path-with-maximum-probability/ |
3 | Cycle Detection | Easy | Find Redundant Connection | LeetCode | https://leetcode.com/problems/redundant-connection/ |
3 | Cycle Detection | Easy | Detect Cycle in Undirected Graph | GFG | https://practice.geeksforgeeks.org/problems/detect-cycle-in-an-undirected-graph/1 |
3 | Cycle Detection | Medium | Course Schedule | LeetCode | https://leetcode.com/problems/course-schedule/ |
3 | Cycle Detection | Medium | Course Schedule II | LeetCode | https://leetcode.com/problems/course-schedule-ii/ |
3 | Cycle Detection | Medium | Detect Cycle in Directed Graph | GFG | https://practice.geeksforgeeks.org/problems/detect-cycle-in-a-directed-graph/1 |
3 | Cycle Detection | Medium | Minimum Height Trees | LeetCode | https://leetcode.com/problems/minimum-height-trees/ |
3 | Cycle Detection | Hard | Alien Dictionary | LeetCode | https://leetcode.com/problems/alien-dictionary/ |
3 | Cycle Detection | Hard | Longest Cycle in a Graph | LeetCode | https://leetcode.com/problems/longest-cycle-in-a-graph/ |
4 | Topological Sort | Easy | All Tasks Scheduling Orders | Educative | https://www.educative.io/courses/grokking-the-coding-interview/xV4BvG1qBAK |
4 | Topological Sort | Easy | Tasks Scheduling | Educative | https://www.educative.io/courses/grokking-the-coding-interview/m25rBmwLV00 |
4 | Topological Sort | Easy | Find Order of Characters | GFG | https://practice.geeksforgeeks.org/problems/alien-dictionary/1 |
4 | Topological Sort | Easy | Prerequisite Tasks | GFG | https://practice.geeksforgeeks.org/problems/prerequisite-tasks/1 |
4 | Topological Sort | Medium | Parallel Courses | LeetCode | https://leetcode.com/problems/parallel-courses/ |
4 | Topological Sort | Medium | Parallel Courses III | LeetCode | https://leetcode.com/problems/parallel-courses-iii/ |
4 | Topological Sort | Medium | Minimum Time to Complete All Tasks | LeetCode | https://leetcode.com/problems/minimum-time-to-complete-all-tasks/ |
4 | Topological Sort | Medium | Sequence Reconstruction | LeetCode | https://leetcode.com/problems/sequence-reconstruction/ |
4 | Topological Sort | Hard | Jump Game IV | LeetCode | https://leetcode.com/problems/jump-game-iv/ |
4 | Topological Sort | Hard | Minimum Height Trees (Hard variant) | LeetCode | https://leetcode.com/problems/minimum-height-trees/ |
5 | Shortest Path Algorithms | Easy | Cheapest Flights Within K Stops | LeetCode | https://leetcode.com/problems/cheapest-flights-within-k-stops/ |
5 | Shortest Path Algorithms | Easy | Dijkstra Implementation | GFG | https://practice.geeksforgeeks.org/problems/implementing-dijkstra-set-1-adjacency-matrix/1 |
5 | Shortest Path Algorithms | Easy | Bellman-Ford | GFG | https://practice.geeksforgeeks.org/problems/distance-from-the-source-bellman-ford-algorithm/1 |
5 | Shortest Path Algorithms | Easy | Minimum Time to Reach Destination | LeetCode | https://leetcode.com/problems/minimum-time-to-reach-destination-in-grid/ |
5 | Shortest Path Algorithms | Medium | Path with Minimum Effort | LeetCode | https://leetcode.com/problems/path-with-minimum-effort/ |
5 | Shortest Path Algorithms | Medium | Network Delay Time | LeetCode | https://leetcode.com/problems/network-delay-time/ |
5 | Shortest Path Algorithms | Medium | Find the City With the Smallest Number of Neighbors | LeetCode | https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/ |
5 | Shortest Path Algorithms | Medium | Minimum Cost to Make at Least One Valid Path | LeetCode | https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/ |
5 | Shortest Path Algorithms | Hard | Minimum Obstacle Removal to Reach Corner | LeetCode | https://leetcode.com/problems/minimum-obstacle-removal-to-reach-corner/ |
5 | Shortest Path Algorithms | Hard | Path With Minimum Effort (Hard variant) | LeetCode | https://leetcode.com/problems/path-with-minimum-effort/ |
6 | Union-Find | Easy | Path Compression Explanation | GFG | https://practice.geeksforgeeks.org/problems/disjoint-set-union-find/1 |
6 | Union-Find | Easy | Union By Rank | GFG | https://practice.geeksforgeeks.org/problems/disjoint-set-union-find/1 |
6 | Union-Find | Easy | Satisfiability of Equality Equations | LeetCode | https://leetcode.com/problems/satisfiability-of-equality-equations/ |
6 | Union-Find | Easy | Accounts Merge | LeetCode | https://leetcode.com/problems/accounts-merge/ |
6 | Union-Find | Medium | Number of Islands II | LeetCode | https://leetcode.com/problems/number-of-islands-ii/ |
6 | Union-Find | Medium | Redundant Connection II | LeetCode | https://leetcode.com/problems/redundant-connection-ii/ |
6 | Union-Find | Medium | Most Stones Removed with Same Row or Column | LeetCode | https://leetcode.com/problems/most-stones-removed-with-same-row-or-column/ |
6 | Union-Find | Medium | Evaluate Division | LeetCode | https://leetcode.com/problems/evaluate-division/ |
6 | Union-Find | Hard | Swim in Rising Water | LeetCode | https://leetcode.com/problems/swim-in-rising-water/ |
6 | Union-Find | Hard | Bricks Falling When Hit | LeetCode | https://leetcode.com/problems/bricks-falling-when-hit/ |
7 | MST (Minimum Spanning Tree) | Easy | Kruskal’s Algorithm | GFG | https://practice.geeksforgeeks.org/problems/minimum-spanning-tree/1 |
7 | MST (Minimum Spanning Tree) | Easy | Prim’s Algorithm | GFG | https://practice.geeksforgeeks.org/problems/minimum-spanning-tree/1 |
7 | MST (Minimum Spanning Tree) | Easy | Connecting Cities With Minimum Cost | GFG | https://practice.geeksforgeeks.org/problems/connecting-the-graph/1 |
7 | MST (Minimum Spanning Tree) | Easy | Optimize Water Distribution | LeetCode | https://leetcode.com/problems/optimize-water-distribution-in-a-village/ |
7 | MST (Minimum Spanning Tree) | Medium | Connecting Islands | GFG | https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1 |
7 | MST (Minimum Spanning Tree) | Medium | Network Connection in Cities | LeetCode | https://leetcode.com/problems/network-connected-in-cities/ |
7 | MST (Minimum Spanning Tree) | Medium | Min Cost to Connect All Points | LeetCode | https://leetcode.com/problems/min-cost-to-connect-all-points/ |
7 | MST (Minimum Spanning Tree) | Medium | Smallest String With Swaps | LeetCode | https://leetcode.com/problems/smallest-string-with-swaps/ |
7 | MST (Minimum Spanning Tree) | Hard | Designing an Efficient Road Network | GFG | https://practice.geeksforgeeks.org/problems/designing-an-efficient-road-network/0 |
7 | MST (Minimum Spanning Tree) | Hard | Min Cost to Supply Water | LeetCode | https://leetcode.com/problems/optimize-water-distribution-in-a-village/ |
8 | Advanced Problems | Easy | Graph Valid Tree | LeetCode | https://leetcode.com/problems/graph-valid-tree/ |
8 | Advanced Problems | Easy | Clone Graph | LeetCode | https://leetcode.com/problems/clone-graph/ |
8 | Advanced Problems | Easy | Reorder Routes to Make All Paths Lead to the City Zero | LeetCode | https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/ |
8 | Advanced Problems | Easy | Reconstruct Itinerary | LeetCode | https://leetcode.com/problems/reconstruct-itinerary/ |
8 | Advanced Problems | Medium | Word Ladder | LeetCode | https://leetcode.com/problems/word-ladder/ |
8 | Advanced Problems | Medium | Word Ladder II | LeetCode | https://leetcode.com/problems/word-ladder-ii/ |
8 | Advanced Problems | Medium | Strongly Connected Components (Kosaraju) | GFG | https://practice.geeksforgeeks.org/problems/strongly-connected-components-kosarajus-algo/1 |
8 | Advanced Problems | Medium | Bridges in Graph | GFG | https://practice.geeksforgeeks.org/problems/bridge-edge-in-graph/1 |
8 | Advanced Problems | Hard | Critical Connections | LeetCode | https://leetcode.com/problems/critical-connections-in-a-network/ |
8 | Advanced Problems | Hard | Shortest Path Visiting All Nodes | LeetCode | https://leetcode.com/problems/shortest-path-visiting-all-nodes/ |
Last active
May 15, 2025 16:36
-
-
Save sameerg07/e96d1ddcbd742f33604fb9028aeb8eda to your computer and use it in GitHub Desktop.
Graphs Roadmap 30 days
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment