Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Solution: Number of Distinct Islands

Explore how to solve the distinct islands problem by implementing a DFS and hash map approach. Understand how to normalize island coordinates for shape comparison and count unique island shapes in a binary matrix grid efficiently.

We'll cover the following...

Statement

Given an m x n binary matrix where 11 represents land and 00 represents water. An island is a group of connected 1s1s that are adjacent horizontally or vertically. Two islands are considered the same if one matches the other without rotating or flipping. The task is to return the number of distinct islands.

Constraints:

  • m == grid.length

  • n == grid[i].length

  • 1≤1 \leq m, n ...