DSA Visualizations | Hello Interview

Limited Time Offer:30% off Hello Interview Premium 🎉

30% off Hello Interview Premium 🎉

Back to Main

Learn DSA

Introduction

Two Pointers

Overview

Container With Most Water

3-Sum

Triangle Numbers

Move Zeroes

Sort Colors

Trapping Rain Water

Sliding Window

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Intervals

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Stack

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Overview

Daily Temperatures

Largest Rectangle in Histogram

Linked List

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Binary Search

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Heap

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Breadth-First Search

Introduction

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Backtracking

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Graphs

Overview

Course Schedule

Course Schedule II

Dynamic Programming

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Greedy Algorithms

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Trie

Overview

Implement Trie Methods

Prefix Matching

Prefix Sum

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Matrices

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Pricing

Become a Coach

Pricing Become a Coach

Get Premium

Types of DFS

Surrounded Regions

Number of Islands

DESCRIPTION (credit Leetcode.com)

You are given binary matrix grid of size m x n, where '1' denotes land and '0' signifies water. Determine the count of islands present in this grid. An island is defined as a region of contiguous land cells connected either vertically or horizontally, and it is completely encircled by water. Assume that the grid is bordered by water on all sides.

Input:


grid = [
[1,1,0,1],
[1,1,0,1],
[1,1,0,0],
]

Output:

💻 Desktop Required

The code editor works best on larger screens. Please open this page on your computer to write and run code.

You are given binary matrix grid of size m x n, where 1 denotes land and 0 signifies water. Determine the count of islands present in this grid. An island is defined as a region of contiguous land cells connected either vertically or horizontally, and it is completely encircled by water. Assume that the grid is bordered by water on all sides.

Run your code to see results here

Have suggestions or found something wrong?

Explanation

This solution uses depth-first search to traverse the grid and count the number of islands.

The algorithm starts at the first cell of the grid and explores all the adjacent cells that are part of the same island. To be part of the same island, a cell must be a 1 and must be adjacent to the current cell. During each recursive call, the algorithm first marks the current cell by changing its value to 0 so that it does not explore the same cell again.

We'll walkthrough how the algorithm detects 2 islands in the example grid:

[ [1, 1, 0, 1], [1, 1, 0, 1], [1, 1, 0, 0] ]

First Island

The algorithm starts by iterating over all cells in the grid. If it finds a 1, it increments the count variable and starts the depth-first search exploration from that cell. The algorithm explores all the reachable cells of the island, marking them as "0" so that it does not explore them again.


def numIslands(grid):
  if not grid:
    return 0

  rows, cols = len(grid), len(grid[0])
  count = 0

  def dfs(r, c):
    grid[r][c] = '0'
    if r + 1 < rows and grid[r + 1][c] == '1':
      dfs(r + 1, c)
    if r > 0 and grid[r - 1][c] == '1':
      dfs(r - 1, c)
    if c + 1 < cols and grid[r][c + 1] == '1':
      dfs(r, c + 1)
    if c > 0 and grid[r][c - 1] == '1':
      dfs(r, c - 1)
    return

  for i in range(rows):
    for j in range(cols):
      if grid[i][j] == '1':
        count += 1
        dfs(i, j)

  return count

i = 0

0 / 19

Once the algorithm has explored all reachable cells of the island, it iterates over the remaining cells to find the start of the next island. When it finds a "1", it increments the count variable and starts the depth-first search exploration again from that cell, this time exploring all the reachable cells of the new island.

Second Island

Once the first call to dfs has returned, the algorithm continues iterating over the remaining cells. When it finds another cell with value of 1, then this is start of a new island.


def numIslands(grid):
  if not grid:
    return 0

  rows, cols = len(grid), len(grid[0])
  count = 0

  def dfs(r, c):
    grid[r][c] = '0'
    if r + 1 < rows and grid[r + 1][c] == '1':
      dfs(r + 1, c)
    if r > 0 and grid[r - 1][c] == '1':
      dfs(r - 1, c)
    if c + 1 < cols and grid[r][c + 1] == '1':
      dfs(r, c + 1)
    if c > 0 and grid[r][c - 1] == '1':
      dfs(r, c - 1)
    return

  for i in range(rows):
    for j in range(cols):
      if grid[i][j] == '1':
        count += 1
        dfs(i, j)

  return count

recursive call

0 / 9

The algorithm continues this process until it has explored all the cells of the grid, at which point it returns the count variable, which contains the number of islands.

Animated Solution


def numIslands(grid):
  if not grid:
    return 0

  rows, cols = len(grid), len(grid[0])
  count = 0

  def dfs(r, c):
    grid[r][c] = '0'
    if r + 1 < rows and grid[r + 1][c] == '1':
      dfs(r + 1, c)
    if r > 0 and grid[r - 1][c] == '1':
      dfs(r - 1, c)
    if c + 1 < cols and grid[r][c + 1] == '1':
      dfs(r, c + 1)
    if c > 0 and grid[r][c - 1] == '1':
      dfs(r, c - 1)
    return

  for i in range(rows):
    for j in range(cols):
      if grid[i][j] == '1':
        count += 1
        dfs(i, j)

  return count

number of islands

0 / 46

Next: Surrounded Regions

Your account is free and you can post anonymously if you choose.

Sort By

Number of Islands

DESCRIPTION (credit Leetcode.com)

💻 Desktop Required

Explanation

First Island

Second Island

Animated Solution

Questions

Learn

Links

Legal

Contact