Part 1: Introduction to Graph
Find both C++/Java codes of all problem in the articles in the first column.
| Topic | Video Solution | Practice Link 1 | Practice Link 2 | |
|---|---|---|---|---|
| Graph and Types | Link | Link | Link | |
| Graph Representation | C++ | Link | Link | Link | |
| Graph Representation | Java | Link | Link | Link | |
| Connected Components | Logic Explanation | Link | Link | Link | |
| BFS | Link | Link | Link | |
| DFS | Link | Link | Link |
Part 2:Problems on BFS/DFS
Find both C++/Java codes of all problem in the articles in the first column.
| Topic | Video Solution | Practice Link 1 | Practice Link 2 | |
|---|---|---|---|---|
| Number of provinces (leetcode) | Link | Link | Link | |
| Connected Components Problem in Matrix | Link | Link | Link | |
| Rotten Oranges | Link | Link | Link | |
| Flood fill | Link | Link | Link | |
| Cycle Detection in undirected Graph (bfs) | Link | Link | Link | |
| Cycle Detection in undirected Graph (dfs) | Link | Link | Link | |
| 0/1 Matrix (Bfs Problem) | Link | Link | Link | |
| Surrounded Regions (dfs) | Link | Link | Link | |
| Number of Enclaves [flood fill implementation – multisource] | Link | Link | Link | |
| Word ladder – 1 | Link | Link | Link | |
| Word ladder – 2 | Link | Link | Link | |
| Number of Distinct Islands [dfs multisource] | Link | Link | Link | |
| Bipartite Graph (DFS) | Link | Link | Link | |
| Cycle Detection in Directed Graph (DFS) | Link | Link | Link |
Part 3: Problems on Topo Sort
Find both C++/Java codes of all problem in the articles in the first column.
| Topic | Video Solution | Practice Link 1 | Practice Link 2 | |
|---|---|---|---|---|
| Topo Sort | Link | Link | Link | |
| Kahn’s Algorithm | Link | Link | Link | |
| Cycle Detection in Directed Graph (BFS) | Link | Link | Link | |
| Course Schedule I | Link | Link | Link | |
| Course Schedule II | Link | Link | Link | |
| Find eventual safe states | Link | Link | Link | |
| Alien dictionary | Link | Link | Link |
Part 4: Shortest Path Algorithms and Problems
Find both C++/Java codes of all problem in the articles in the first column.
| Topic | Video Solution | Practice Link 1 | Practice Link 2 | |
|---|---|---|---|---|
| Shortest Path in UG with unit weights | Link | Link | Link | |
| Shortest Path in DAG | Link | Link | Link | |
| Djisktra’s Algorithm | Link | Link | Link | |
| Why priority Queue is used in Djisktra’s Algorithm | Link | Link | Link | |
| Shortest path in a binary maze | Link | Link | Link | |
| Path with minimum effort | Link | Link | Link | |
| Cheapest flights within k stops | Link | Link | Link | |
| Network Delay time | Link | Link | Link | |
| Number of ways to arrive at destination | Link | Link | Link | |
| Minimum steps to reach end from start by performing multiplication and mod operations with array elements | Link | Link | Link | |
| Bellman Ford Algorithm | Link | Link | Link | |
| Floyd Warshal Algorithm | Link | Link | Link | |
| Find the city with the smallest number of neighbors in a threshold distance | Link | Link | Link |
Part 5: MinimumSpanningTree/Disjoint Set
Find both C++/Java codes of all problem in the articles in the first column.
| Topic | Video Solution | Practice Link 1 | Practice Link 2 | |
|---|---|---|---|---|
| Minimum Spanning Tree | Link | Link | Link | |
| Prim’s Algorithm | Link | Link | Link | |
| Disjoint Set [Union by Rank] | Link | Link | Link | |
| Disjoint Set [Union by Size] | Link | Link | Link | |
| Kruskal’s Algorithm | Link | Link | Link | |
| Number of operations to make network connected | Link | Link | Link | |
| Most stones removed with same rows or columns | Link | Link | Link | |
| Accounts merge | Link | Link | Link | |
| Number of island II | Link | Link | Link | |
| Making a Large Island | Link | Link | Link | |
| Swim in rising water | Link | Link | Link |