Skip to content
graph from start
Graph Traversal (BFS/DFS)
Table 23
Problem Title
Leetcode Link
Difficulty
Checkbox
There are no rows in this table
Step 2: Topological Sorting (Kahn’s Algorithm + DFS)
Table 24
Problems
Link
Difficulty
Checkbox
Minimum Number of Vertices to Reach All Nodes
Medium
There are no rows in this table
Step 3: Detecting Cycles (Directed + Undirected)
Table 25
Problem Title
LeetCode Link
Difficulty
Checkbox
There are no rows in this table
Step 4: Shortest Path Algorithms (BFS, Dijkstra, Bellman-Ford, 0-1 BFS)
Table 26
Problems
Link
Difficulty
Checkbox
There are no rows in this table
Step 5: Union Find (Disjoint Set Union - DSU)
Table 27
Problems
Link
Difficulty
Checkbox
Number of Connected Components in Undirected Graph
Medium
There are no rows in this table
Step 6: Minimum Spanning Tree (Prim’s & Kruskal’s)
Table 28
Problem Title
LeetCode Link
Difficulty
Checkbox
There are no rows in this table
Step 7: Backtracking + Graphs Hybrid
Table 29
Problems
Links
Difficulty
Checkbox
There are no rows in this table
Step 8: DP on Graphs (Memoized DFS)
Table 30
Problem Title
LeetCode Link
Difficulty
Checkbox
There are no rows in this table
Step 9: Advanced Graph Problems (Hard-Level)
Table 31
Problem
link
difficulty
Checkbox
There are no rows in this table
Additional Problems
Table 32
problems
link
difficulty
Checkbox
There are no rows in this table
Want to print your doc?
This is not the way.
This is not the way.
Try clicking the ⋯ next to your doc name or using a keyboard shortcut (
CtrlP
) instead.