Get started
Start with DSA Fundamentals
Programming Fundamentals
Back to modulesModule 15 · 0/54
Module 15
Graphs
0/5431239
Introduction to Graphs0/6
BFS & DFS Problems0/14
- 1Number of ProvincesMed.
- 2Connected Components in MatrixHard
- 3Rotten OrangesMed.
- 4Flood FillHard
- 5Cycle Detection in Undirected Graph (BFS)Hard
- 6Cycle Detection in Undirected Graph (DFS)Hard
- 7Distance of Nearest Cell having 1Med.
- 8Surrounded RegionsHard
- 9Number of EnclavesHard
- 10Word Ladder IHard
- 11Word Ladder IIHard
- 12Number of Distinct IslandsHard
- 13Is Graph Bipartite?Med.
- 14Cycle Detection in Directed Graph (DFS)Hard
Topological Sort0/7
Shortest Path Algorithms0/13
- 1Shortest Path in Undirected Graph with Unit WeightsHard
- 2Shortest Path in DAGHard
- 3Dijkstra's AlgorithmHard
- 4Why Priority Queue in Dijkstra?Med.
- 5Shortest Path in Binary MazeMed.
- 6Path With Minimum EffortMed.
- 7Cheapest Flights Within K StopsHard
- 8Network Delay TimeMed.
- 9Number of Ways to Arrive at DestinationMed.
- 10Minimum Multiplications to Reach EndHard
- 11Bellman-Ford AlgorithmHard
- 12Floyd-Warshall AlgorithmHard
- 13City With Smallest Number of NeighborsHard
MST & Disjoint Set0/11
- 1Minimum Spanning Tree (MST) ConceptsHard
- 2Prim's AlgorithmHard
- 3Disjoint Set (Union by Rank)Hard
- 4Disjoint Set (Union by Size)Hard
- 5Kruskal's AlgorithmHard
- 6Number of Operations to Make Network ConnectedMed.
- 7Most Stones Removed with Same Row or ColumnMed.
- 8Accounts MergeHard
- 9Number of Islands IIHard
- 10Making A Large IslandHard
- 11Swim in Rising WaterHard