Enhance your skills in Union-Find to address diverse graph and connectivity problems.

Central CIP Path

Union Find

# Statement

Let’s consider a scenario with an $(m \times n)$ 2D grid containing binary numbers, where `'0'` represents water and `'1'` represents land. If any `'1'` cells are connected to each other horizontally or vertically (not diagonally), they form an island. Your task is to return the total number of islands in the grid.

**Constraints:**

* $1 \leq$ `grid.length` $\leq 50$

* $1 \leq$ `grid[i].length` $\leq 50$

* `grid[i][j]` is either `'0'` or `'1'`.

# Solution


Let's solve the Number of Islands problem using the Union Find pattern.

Solution: Number of Islands

Statement▼

Solution

Solution: Number of Islands

Statement▼

Solution