Solo practice workspace

Interview Coder drill

Number of Islands

20:00

Medium

Given rows of 0s and 1s, count connected groups of 1s using horizontal and vertical neighbors. Print the count.

Example 1

Input: grid = ["11110","11010","11000","00000"]

Output: 1

All land cells connect into one island.

Constraints

1 <= rows, cols <= 300Rows contain only 0 and 1

Recall before you code

Capture your plan, then rate how clearly you recalled it before submitting.

What cues point to the Graphs BFS/DFS pattern?What invariant or template will you maintain?Which edge cases could break your approach?

How well did you recall the approach?

solution.py

Runs: 0 | Submissions: 0

Loading Python runtime...