Number of distinct islands
Given an m x n binary grid, an island is a group of 1s connected 4-directionally. Two islands are considered the same if and only if one can be translated (shifted, not rotated or reflected) to equal the other. Return the number of distinct island shapes. The grid may be empty of land.
Implement
num_distinct_islands(grid: list[list[int]]) → intExamples
in
[[[1,1,0,0,0],[1,1,0,0,0],[0,0,0,1,1],[0,0,0,1,1]]]out1What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[[[1,1,0,0,0],[1,1,0,0,0],[0,0,0,1,1],[0,0,0,1,1]]]1not run yetsample