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

Solution: Number of Distinct Islands

Explore the method to count distinct islands in a binary matrix using depth-first search and hash maps. This lesson helps you understand how to normalize island coordinates and efficiently track unique island shapes to solve the problem with optimal time and space complexity.

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 ...