Learning
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 1222 | Introduction to Graph | Easy | Learning | A2Z |
| 2870 | Graph Representation | C++ | Easy | Learning | A2Z |
| 2871 | Graph Representation | Java | Easy | Learning | A2Z |
| 528 | Connected Components | Medium | Learning | A2Z B75 |
| 529 | Traversal Techniques | Medium | Learning | A2Z SDE |
| 2831 | DFS | Medium | Learning | A2Z SDE |
Problems on BFS/DFS
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 535 | Number of provinces | Medium | Problems on BFS/DFS | A2Z |
| 2830 | Connected Components Problem in Matrix | Medium | Problems on BFS/DFS | A2Z |
| 536 | Rotten Oranges | Medium | Problems on BFS/DFS | A2Z SDE |
| 531 | Flood fill algorithm | Medium | Problems on BFS/DFS | A2Z |
| 2817 | Cycle Detection in Undirected Graph (bfs) | Hard | Problems on BFS/DFS | A2Z |
| 501 | Detect a cycle in an undirected graph | Hard | Problems on BFS/DFS | A2Z |
| 530 | Distance of nearest cell having one | Medium | Problems on BFS/DFS | A2Z |
| 537 | Surrounded Regions | Medium | Problems on BFS/DFS | A2Z |
| 533 | Number of enclaves | Medium | Problems on BFS/DFS | A2Z |
| 509 | Word ladder I | Hard | Problems on BFS/DFS | A2Z |
| 510 | Word ladder II | Hard | Problems on BFS/DFS | A2Z |
| 534 | Number of islands | Medium | Problems on BFS/DFS | A2Z |
| 2813 | Bipartite Graph (DFS) | Hard | Problems on BFS/DFS | A2Z |
| 2814 | Cycle Detection in Directed Graph (DFS) | Hard | Problems on BFS/DFS | A2Z |
| 2832 | Flood-fill Algorithm | Medium | Problems on BFS/DFS | SDE |
| 188 | Clone Graph | Medium | Problems on BFS/DFS | SDE B75 |
| 2818 | Detect A cycle in Undirected Graph using BFS | Hard | Problems on BFS/DFS | SDE |
| 2819 | Detect A cycle in Undirected Graph using DFS | Hard | Problems on BFS/DFS | SDE |
| 2833 | Number of islands(Do in Grid and Graph Both) | Medium | Problems on BFS/DFS | SDE B75 |
| 499 | Bipartite graph | Hard | Problems on BFS/DFS | SDE |
| 2812 | Bipartite Check using DFS | Hard | Problems on BFS/DFS | SDE |
| 2403 | Pacific Atlantic Water Flow | Easy | Problems on BFS/DFS | B75 |
| 495 | Graph Valid Tree | Medium | Problems on BFS/DFS | B75 |
Topo Sort and Problems
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 2822 | Topo Sort | Hard | Topo Sort and Problems | A2Z |
| 502 | Topological sort or Kahn's algorithm | Hard | Topo Sort and Problems | A2Z |
| 500 | Detect a cycle in a directed graph | Hard | Topo Sort and Problems | A2Z |
| 504 | Course Schedule I | Hard | Topo Sort and Problems | A2Z B75 |
| 505 | Course Schedule II | Medium | Topo Sort and Problems | A2Z |
| 506 | Find eventual safe states | Hard | Topo Sort and Problems | A2Z |
| 503 | Alien Dictionary | Hard | Topo Sort and Problems | A2Z B75 |
| 2816 | Detect A cycle in a Directed Graph using DFS | Hard | Topo Sort and Problems | SDE |
| 2815 | Detect A cycle in a Directed Graph using BFS | Hard | Topo Sort and Problems | SDE |
| 2820 | Topological Sort BFS | Hard | Topo Sort and Problems | SDE |
| 2821 | Topological Sort DFS | Hard | Topo Sort and Problems | SDE |
Shortest Path Algorithms and Problems
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 508 | Shortest path in undirected graph with unit weights | Hard | Shortest Path Algorithms and Problems | A2Z |
| 507 | Shortest path in DAG | Hard | Shortest Path Algorithms and Problems | A2Z |
| 2827 | Djisktra's Algorithm | Hard | Shortest Path Algorithms and Problems | A2Z |
| 2828 | Why priority Queue is used in Djisktra's Algorithm | Hard | Shortest Path Algorithms and Problems | A2Z |
| 527 | Shortest Distance in a Binary Maze | Hard | Shortest Path Algorithms and Problems | A2Z |
| 525 | Path with minimum effort | Hard | Shortest Path Algorithms and Problems | A2Z |
| 519 | Cheapest flight within K stops | Hard | Shortest Path Algorithms and Problems | A2Z |
| 764 | Network Delay Time | Medium | Shortest Path Algorithms and Problems | A2Z |
| 524 | Number of ways to arrive at destination | Hard | Shortest Path Algorithms and Problems | A2Z |
| 523 | Minimum multiplications to reach end | Hard | Shortest Path Algorithms and Problems | A2Z |
| 2826 | Bellman Ford Algorithm | Hard | Shortest Path Algorithms and Problems | A2Z |
| 522 | Floyd warshall algorithm | Hard | Shortest Path Algorithms and Problems | A2Z |
| 521 | Find the city with the smallest number of neighbors | Hard | Shortest Path Algorithms and Problems | A2Z |
| 520 | Dijkstra's algorithm | Hard | Shortest Path Algorithms and Problems | SDE |
| 518 | Bellman ford algorithm | Hard | Shortest Path Algorithms and Problems | SDE |
| 2829 | Floyd Warshall Algorithm | Hard | Shortest Path Algorithms and Problems | SDE |
MinimumSpanningTree/Disjoint Set and Problems
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 1221 | MST theory | Easy | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 2825 | Prim's Algorithm | Hard | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 516 | Disjoint Set | Hard | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 517 | Find the MST weight | Hard | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 515 | Number of operations to make network connected | Hard | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 513 | Most stones removed with same row or column | Medium | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 511 | Accounts merge | Hard | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 514 | Number of islands II | Hard | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 512 | Making a large island | Hard | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 1006 | Swim in Rising Water | Medium | MinimumSpanningTree/Disjoint Set and Problems | A2Z |
| 2824 | MST using Prim's Algo | Hard | MinimumSpanningTree/Disjoint Set and Problems | SDE |
| 2823 | MST using Kruskal's Algo | Hard | MinimumSpanningTree/Disjoint Set and Problems | SDE |
Other Algorithms
| ID | Problem | Difficulty | Section | Sheets |
|---|---|---|---|---|
| 497 | Bridges in graph | Hard | Other Algorithms | A2Z |
| 496 | Articulation point in graph | Hard | Other Algorithms | A2Z |
| 498 | Kosaraju's algorithm | Hard | Other Algorithms | A2Z |
| 2811 | Strongly Connected Component(using KosaRaju's algo) | Hard | Other Algorithms | SDE |