Count connected components in a binary grid

Q: Count connected components in a binary grid

This question evaluates understanding of graph traversal and connected-components detection on a 2D grid, measuring the ability to model grid cells as nodes with four-directional adjacency and reason about connectivity.

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

Loading...

You are given an m x n grid of characters '0' and '1':

'1' represents land
'0' represents water

Two land cells are connected if they share an edge (4-directional adjacency: up/down/left/right).

Task: Return the number of connected land components ("islands").

Input

grid : m x n matrix of characters '0' / '1'

Output

An integer: the number of islands

Constraints

1 <= m, n <= 300
grid[i][j] ∈ {'0','1'}

Example

Input:

1 1 0 0
1 0 0 1
0 0 1 1

Output:

Count connected components in a binary grid

Quick Overview

Input

Output

Constraints

Example

Comments (0)