Count connected islands using Union-Find

Q: Count connected islands using Union-Find

This question evaluates understanding of union-find (disjoint set) data structures and graph connectivity concepts for counting connected components in grid-based problems.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given an m x n grid of characters where '1' represents land and '0' represents water. An island is a group of horizontally or vertically adjacent land cells.

Return the number of islands in the grid.

Constraints/notes:

Adjacency is 4-directional (up/down/left/right), not diagonal.
Aim to solve using a Union-Find (Disjoint Set Union) approach (even though DFS/BFS also works).

Example: Grid: 1 1 0 0 1 0 1 0 1 Output: 3

Count connected islands using Union-Find

Quick Overview

Comments (0)