17. Graph
BFS
1. Number of Provinces - LeetCode
2. Rotten Oranges - LeetCode
3. Perfect Squares - LeetCode
4. Open the Lock - LeetCode
5. Minimum Genetic Mutation - LeetCode
6. Word Ladder - LeetCode
7. Word Ladder II - LeetCode
8. Shortest Path in Binary Matrix - LeetCode
9. Jump Game IV - LeetCode
10. Sliding Puzzle - LeetCode
DFS
2. Number of Islands - LeetCode
3. Max Area of Island - LeetCode
4. Count Sub Islands - LeetCode
5. Number of Distinct Islands - LeetCode
6. Number of Distinct Islands II - LeetCode
7. Surrounded Regions - LeetCode
8. Pacific Atlantic Water Flow - LeetCode
Cycle Detection
1. Detect Cycle in Undirected Graph - GFG
2. Detect Cycle in Directed Graph - GFG
3. Course Schedule - LeetCode
4. Eventual Safe States - LeetCode
5. Longest Cycle in a Graph - LeetCode
6. Redundant Connection - LeetCode
7. Redundant Connection II - LeetCode
8. Graph Valid Tree - LeetCode
9. Minimum Height Trees - LeetCode
10. Reconstruct Itinerary - LeetCode
Bipartite Graphs
1. Is Graph Bipartite? - LeetCode
2. Possible Bipartition - LeetCode
3. Cycle Detection in Bipartite Graph - [Conceptual]
4. Check for Odd-Length Cycle - [Conceptual]
5. M-Coloring Problem - GFG
6. Graph Coloring
7. Team Division - [Codeforces/GFG]
8. Union Find Bipartition Check - [Conceptual]
9. Two Groups
10. Graph Coloring with Constraints - [Advanced Interview Variant]
Topological Sort
1. Course Schedule II - LeetCode
2. Alien Dictionary - LeetCode
3. All Tasks Scheduling Orders
4. Sequence Reconstruction - LeetCode
5. Parallel Courses - LeetCode
6. Parallel Courses III - LeetCode
7. Minimum Time to Complete All Tasks - LeetCode
8. Build a Matrix With Conditions - LeetCode
9. Sort Items by Groups Respecting Dependencies - LeetCode
10. Minimum Height Trees - LeetCode
Shortest Path
1. Dijkstra Template - GFG
2. Network Delay Time - LeetCode
3. Path with Minimum Effort - LeetCode
4. Maze with Portals (0-1 BFS) - [Conceptual]
5. Cheapest Flights Within K Stops - LeetCode
6. Reach the End in Time - [Advanced]
7. Minimum Cost to Reach Destination in Time - LeetCode
8. Minimum Path Sum with Obstacles - LeetCode
9. Bellman-Ford Shortest Path - GFG
10. Multi-Source BFS - [Conceptual]
Minimum Spanning Tree
1. Prim’s Algorithm
2. Kruskal’s Algorithm
3. Connecting Cities With Minimum Cost - LeetCode
4. Optimize Water Distribution - LeetCode
5. Min Cost to Connect All Points - LeetCode
6. Island Connection - [LeetCode Variant]
7. Fiber Optic Lines Optimization - [Conceptual]
8. Cost to Build Roads - [Codeforces/Custom]
9. Minimum Cost to Supply Water - LeetCode
10. MST with Constraints - [Advanced Variant]
Union Find (DSU)
1. Find Union Basic Template - GFG
2. Redundant Connection - LeetCode
3. Redundant Connection II - LeetCode
4. Accounts Merge - LeetCode
5. Satisfiability of Equality Equations - LeetCode
6. Most Stones Removed - LeetCode
7. Number of Good Paths - LeetCode
8. Count Components - LeetCode
9. Smallest String With Swaps - LeetCode
10. Connecting Graphs with Threshold - [Hard Variant]
Bridge and Articulation Points
1. Critical Connections in a Network - LeetCode
2. Articulation Points - GFG
3. Bridges in Graph - GFG
4. Biconnected Graph - GFG
5. Local Area Disconnection Points - [Conceptual]
6. Island Connectivity Restoration - [Conceptual]
7. Remove Minimum Bridges to Disconnect - [Conceptual]
8. Split Graph into Trees - [Custom/Advanced]
9. Strong Network Splitting Points - [Advanced]
10. Fault Tolerant Network - [Custom]
Strongly Connected Components
1. Kosaraju’s Algorithm - GFG
2. Tarjan’s Algorithm - GFG
3. Find SCC in Directed Graph - [Conceptual]
4. Condensation Graph - [Conceptual]
5. Minimum Edges to Make Strongly Connected - GFG
6. Strong Connectivity Query - [Conceptual]
7. Tournament Graph - [Advanced]
8. Network Collapse Simulation - [Custom]
9. Mutual Dependency Clusters - [Advanced]
10. Count Unreachable Pairs - LeetCode