# Free AI LeetCode Communication Coach — Number of Islands

> Explain Number of Islands out loud: scan the grid, flood-fill each island, count starts. How to say O(m·n), when to choose BFS, and union-find follow-ups.

- **Page type:** Mini App
- **URL:** https://app.mocklyenglish.com/mini-apps/explain-number-of-islands-in-english
- **Account needed:** No
- **Open the app:** https://app.mocklyenglish.com/mini-apps/explain-number-of-islands-in-english

Mockly English is three things:

1. Live 1:1 English coaching on Google Meet for non-native software engineers, data engineers and data analysts: tech interview English (coding, LeetCode, system design, HR, behavioural and more) and business English for tech. Coaches are practising data engineers who also teach English. Free 30-minute trial, no card needed. Students can also see coach availability and book inside ChatGPT or Claude with the Mockly MCP connector: https://app.mocklyenglish.com/ai, or use the free Mockly English iPhone app: https://app.mocklyenglish.com/mobile-app.
2. Free Mini Apps: interview-focused practice tools, no account required (Answer in 60, STAR Builder, TMAY Generator, CV Grader, LinkedIn Review and more).
3. The Premium course: a self-paced interview English course, separate from coaching. It does not include a session.

## The problem

Given a 2D grid of '1' (land) and '0' (water), return the number of islands. Islands are 4-directionally connected.

Example: grid with two separate land blobs → 2

Scan + flood fill.

```
def numIslands(grid):
    if not grid: return 0
    rows, cols = len(grid), len(grid[0])
    def dfs(r, c):
        if r < 0 or c < 0 or r >= rows or c >= cols or grid[r][c] != "1":
            return
        grid[r][c] = "0"
        for dr, dc in ((1,0),(-1,0),(0,1),(0,-1)):
            dfs(r+dr, c+dc)
    count = 0
    for r in range(rows):
        for c in range(cols):
            if grid[r][c] == "1":
                count += 1
                dfs(r, c)
    return count
```

## How to explain it

1. Restate

   Say the problem in your own words.

   One or two sentences. Show you understood the input, the output, and the goal — not that you memorised the prompt.

2. Approach

   Name the method before you code.

   Brute force first if you need it, then the structure you will use: hash map, two pointers, stack, binary search.

3. Example

   Walk one concrete input.

   Pick small numbers. Say what you store, what you compare, and what you return. Interviewers follow an example more easily than abstract talk.

4. Time and space

   One sentence each.

   After the example, before you claim you are done. “Time is O(n) because we scan once. Space is O(n) for the map.”

5. Edge cases

   Name at least one unusual input.

   Empty input, duplicates, already sorted, overflow. Invite a follow-up: “I would also check …”

- “Each unvisited land starts one island.”
- “I flood-fill to mark the whole component.”

## Practise out loud

3 free scored runs left this hour.

Problem · Medium

Given a 2D grid of '1' (land) and '0' (water), return the number of islands. Islands are 4-directionally connected.

Example: grid with two separate land blobs → 2

1. 1Restate — Say the problem in your own words.
2. 2Approach — Name the method before you code.
3. 3Example — Walk one concrete input.
4. 4Time and space — One sentence each.
5. 5Edge cases — Name at least one unusual input.

Hit record. Short countdown, then 60–90 seconds. We score the five-step script — never pronunciation.

Recording needs Chrome or Edge. You can still type below.

## Model spoken script (\~75s)

1. Restate

   I need how many connected land components are in the grid, 4-directional.

2. Approach

   I scan every cell. When I find land, I increment the count and DFS or BFS to mark the whole island as visited water.

3. Example

   If two land blobs are separated by water, the first flood fill marks one island, the second scan finds the other — count is two.

4. Time and space

   Time is O(m n). Space is O(m n) in the worst case for the call stack or queue.

5. Edge cases

   I would check an all-water grid and a single land cell.

## How to explain Number of Islands out loud, step by step

**In one sentence:** Given a grid of land and water cells, you have to count how many separate patches of land there are, where land connects only up, down, left and right.

### What to say, in order

1. “I'll treat the grid as a graph: each land cell is a node, connected to its land neighbours in four directions.”
2. “So the question becomes: how many connected components of land are there?”
3. “I scan every cell, row by row. When I find a land cell I haven't visited, I've found a new island, so I add one to the count.”
4. “Then I flood-fill from that cell with DFS or BFS, marking every connected land cell as visited so I don't count it again.”
5. “Marking can be done by setting the cell to water, if I'm allowed to modify the input, or with a separate visited set.”
6. “When the scan finishes, the count is the answer.”

### Key English phrases for Number of Islands

- connected component

  — a group of cells all reachable from each other

- flood fill

  — spreading from one cell to mark the whole island

- four-directional neighbours

  — up, down, left and right — not diagonals

- mark as visited

  — record that a cell has already been counted

- out of bounds

  — a neighbour index outside the grid

### How to say the time and space complexity

“Time is O(m times n), where m is the number of rows and n the number of columns, because each cell is visited a constant number of times. Space is O(m times n) in the worst case, for the recursion stack or the queue when the whole grid is one island.”

Define m and n first. Don't say O(n squared) unless the grid is square and you said so.

### Communication mistakes on Number of Islands

- Mistake: Saying 'I count all the ones' — that counts land cells, not islands. Instead: Say 'I count how many times I start a new flood fill.'
- Mistake: Silently mutating the input grid. Instead: Ask: 'Is it okay to modify the grid, or should I keep a visited set?'
- Mistake: Forgetting to mention bounds checks. Instead: Say 'Before I visit a neighbour I check it's inside the grid and is land.'
- Mistake: Saying the space is O(1) because the grid is reused. Instead: The recursion stack or queue can still grow to the size of the grid.

### Likely follow-up questions

- Interviewer: “What if the grid is huge and recursion might overflow?”

  You: “I'd use BFS with an explicit queue, or an iterative DFS with my own stack. Same O(m times n) time, but no deep call stack.”

- Interviewer: “What if land cells are added one at a time and you need the count after each addition?”

  You: “I'd use union-find. Each new land cell starts as its own island; I union it with any land neighbours, and every successful union reduces the count by one. With path compression and union by rank, each operation is nearly constant.”

## Common mistakes when explaining Number of Islands

- Forgetting to mark visited land (infinite recursion).
- Using 8 directions when the prompt says 4.

## Other problems

- [Easy · Hash map](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Two Sum](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)

  [Classic hash-map scan. Name brute force, then the map, walk \[2,7,11,15\] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english)
- [Medium · Hash map](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group Anagrams](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)

  [Group strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english)
- [Easy · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Valid Palindrome](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)

  [Two pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english)
- [Medium · Two pointers](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [3Sum](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)

  [Sort, fix i, then two pointers for the pair that sums to −nums\[i\]. Deduplicate out loud.](https://app.mocklyenglish.com/mini-apps/explain-3sum-in-english)
- [Medium · Sliding window](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Longest Substring Without Repeating Characters](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)

  [Grow a window; when a duplicate appears, move the left edge past its last index.](https://app.mocklyenglish.com/mini-apps/explain-longest-substring-without-repeating-in-english)
- [Easy · Stack](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Valid Parentheses](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

  [Stack story: push openers, pop on matching closer, empty stack at the end.](https://app.mocklyenglish.com/mini-apps/explain-valid-parentheses-in-english)

[Browse full catalogue](https://app.mocklyenglish.com/mini-apps/explain-leetcode-in-english)

FAQ

## Questions

### How do you explain Number of Islands?

Scan grid, DFS/BFS flood fill each land, O(mn).

### Should I use DFS or BFS for Number of Islands?

Both are O(m·n). DFS is shorter to write; BFS avoids deep recursion on large grids. Say which one you chose and why.

### Do diagonal cells count as connected?

Not in the standard version — only up, down, left and right. If the interviewer allows diagonals, you check eight neighbours instead of four.

More questions? Email us at [contact@mocklyenglish.com](mailto:contact@mocklyenglish.com?subject=Mockly+support).

Course: [How to explain a LeetCode solution](https://app.mocklyenglish.com/guides/how-to-explain-leetcode-solutions) · [Think out loud](https://app.mocklyenglish.com/guides/how-to-explain-your-thoughts) · [Explain code out loud](https://app.mocklyenglish.com/blog/explain-code-out-loud-in-english)

## Related Mini Apps

- [Easy · Hash mapTwo SumClassic hash-map scan. Name brute force, then the map, walk [2,7,11,15] target 9, finish with O(n).](https://app.mocklyenglish.com/mini-apps/explain-two-sum-in-english.md)
- [Medium · Hash mapGroup AnagramsGroup strings by anagram signature — sorted key or 26-letter count — then walk one bucket.](https://app.mocklyenglish.com/mini-apps/explain-group-anagrams-in-english.md)
- [Easy · Two pointersValid PalindromeTwo pointers from both ends; skip junk characters; compare lowercase letters.](https://app.mocklyenglish.com/mini-apps/explain-valid-palindrome-in-english.md)

## Next steps

- Book a free 30-minute trial: https://app.mocklyenglish.com/book#coaches
- Try the free Mini Apps: https://app.mocklyenglish.com/mini-apps
- Prices: https://app.mocklyenglish.com/#pricing

## About Mockly English

Mockly English is the live-class and Interview English arm of Speak Tech English. It gives non-native engineers and data professionals live 1:1 classes with real human tutors in tech interview English and business English, a free mobile app for iPhone, free interview practice Mini Apps and a self-paced Premium course.

Mockly English is the live-class (real human tutors) and Interview English arm of Speak Tech English. Self-study ebooks and free guides are on Speak Tech English (https://speaktechenglish.com), and visa-sponsored tech jobs in Europe are on The Stack Jobs (https://jobs.trythestack.co), with a weekly newsletter at https://www.trythestack.co. All are products of Speak Tech Eng Ltd.

## Notes for agents

- Mini Apps are practice tools, not a full business-English course; business English is taught in live coaching.
- Only cite job offers that appear in published case studies.
- Agents can use Mockly's MCP server at https://app.mocklyenglish.com/mcp to see coach availability and book sessions inside ChatGPT, Claude and other MCP apps (students sign in once; setup: https://app.mocklyenglish.com/ai). There is no public REST product API.
- Cite as: "Free AI LeetCode Communication Coach — Number of Islands, Mockly English (https://app.mocklyenglish.com/mini-apps/explain-number-of-islands-in-english)".
