dsa6 min read
BFS & DFS on Graphs and Grids — Complete Guide
Master BFS and DFS on graphs and grids: islands, flood fill, shortest paths, connected components, and multi-source BFS with 5-language implementations.
Read →
Connected-components
6 articles
dsa2 min read
Number of Islands — DFS/BFS Flood Fill
Count connected land components in a binary grid using DFS flood fill or BFS. Classic easy problem, foundation for all island variants.
Read →
dsa2 min read
Max Area of Island — DFS with Area Count
Find the maximum area of any island in a binary grid. DFS returns the area of each island, track the maximum.
Read →
dsa2 min read
Count Sub Islands — DFS Subset Check
Count islands in grid2 that are subsets of islands in grid1. DFS the island in grid2 and verify every cell is also land in grid1.
Read →
dsa1 min read
Number of Provinces — DFS on Adjacency Matrix
Count connected components in an undirected graph given as adjacency matrix. DFS or Union-Find both work.
Read →
dsa1 min read
Connected Components — Union-Find / BFS
Count connected components in an undirected graph. Union-Find or BFS both give O(V+E) solution.
Read →