Island Problem Traversal

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Island Problem Traversal. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Solve the island counting problem on a grid using connected-component traversal.

Implement num_islands(grid), where grid is a rectangular list of lists containing only the strings "1" and "0". Return the number of connected components of "1" cells, considering only up, down, left, and right neighbors. The function may use an iterative traversal and may modify the input grid.

Constraints

1 <= len(grid) <= 50
1 <= len(grid[0]) <= 50
Every row has the same length as grid[0].
Each cell is either "0" or "1".
Cells connect only in the four orthogonal directions.

Function Signature

def num_islands(grid):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output