# Number Of Distinct Islands II: Interview Notes

Number Of Distinct Islands II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Same as distinct islands, but two islands are the same if one can be translated, rotated, or reflected onto the other. Canonicalize each shape by generating all 8 dihedral transforms, translating each to the origin, and taking the lexicographically smallest coordinate list.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(mn log mn) to sort shapes.

## Common mistake

Only translating (distinct islands I) and missing rotations/reflections, which overcounts the same shape.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.