◈
Graphs
BFS, DFS, topological sort, shortest path, union-find, and connected components.
Start Practice
GraphsBeginnerIntermediateAdvancedQuestions: 1–5
Choose mode, difficulty & questions on the next screen
What You'll Practice (5 techniques)
BFS/DFS traversalTopological sortUnion-FindDijkstra'sCycle detection
Prerequisites
Trees
Stacks & Queues
Hash Maps
Difficulty Levels
Beginner
Core pattern recognition, fundamental approach.
Intermediate
Pattern variations, edge cases, optimization.
Advanced
Complex combinations, merge multiple patterns.