# Number Of Islands II: Walkthrough

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

## Key idea

Online Union-Find: each addLand turns a water cell to land and unions it with existing land neighbors; append the live component count after each operator.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(k α(k)).

## Common mistake

Recomputing the whole grid with a flood fill after every insertion, which is far too slow.

## 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 try it free.