Graph Traversal: BFS & DFS (Number of Islands)
Language:
Graphs & MatricesTime: O(M × N)Space: O(M × N)

Graph Traversal: BFS & DFS (Number of Islands)

Standard Technical Benchmark Problem: Number of Islands (LeetCode 200)

Algorithmic Concept & Core Invariant

Traverse connected components in a 2D matrix or graph. BFS uses a queue to expand layer-by-layer; DFS uses recursion to drill down to boundaries and mark cells visited in-place.

Try Custom Input: 3x3 Binary Grid (1=Land, 0=Water)

3 rows of 3 bits (1 or 0) separated by / (e.g. 110 / 010 / 101)

Interactive Trace: Step 1 / 5
🏝️ 1
🏝️ 1
🌊 0
🏝️ 1
🏝️ 1
🌊 0
🌊 0
🌊 0
🏝️ 1
Discovered Islands Count: 1
State Watch:r=0c=0islands=1
ACTIONFound land at (0,0)! Start DFS flood-fill for Island #1.
JavaScript Reference ImplementationZero third-party dependencies
function numIslands(grid) {
  if (!grid || grid.length === 0) return 0;
  const rows = grid.length, cols = grid[0].length;
  let islands = 0;

  function dfs(r, c) {
    if (r < 0 || r >= rows || c < 0 || c >= cols || grid[r][c] !== '1') return;
    grid[r][c] = '0'; // Mark visited
    dfs(r + 1, c);
    dfs(r - 1, c);
    dfs(r, c + 1);
    dfs(r, c - 1);
  }

  for (let r = 0; r < rows; r++) {
    for (let c = 0; c < cols; c++) {
      if (grid[r][c] === '1') {
        islands++;
        dfs(r, c);
      }
    }
  }
  return islands;
}
Real-World Production Infrastructure Usage

Image processing flood-fill (paint bucket), garbage collection reachability (mark-and-sweep), and cloud VPC cluster isolation analysis.

Algorithm Engineering & Interview Notes

Deep-Dive Guide: Mastering Graph Traversal: BFS & DFS (Number of Islands) for Technical Interviews

Graph Traversal: BFS & DFS (Number of Islands) is one of the highest-frequency building blocks in coding interviews—most famously benchmarked via "Number of Islands (LeetCode 200)". Traverse connected components in a 2D matrix or graph. BFS uses a queue to expand layer-by-layer; DFS uses recursion to drill down to boundaries and mark cells visited in-place.

From an asymptotic perspective, this pattern achieves O(M × N) time complexity and O(M × N) auxiliary space complexity. A staple of FAANG interviews. Modern engineers explain how BFS calculates shortest paths in unweighted networks and how flood-fill algorithms operate in image processing.

In production engineering, this exact technique powers real infrastructure: Image processing flood-fill (paint bucket), garbage collection reachability (mark-and-sweep), and cloud VPC cluster isolation analysis. Stepping through the live state trace and comparing both the JavaScript and Python 3 implementations above builds intuition for pointer bounds, loop termination conditions, and edge cases.

Interview Execution & Edge-Case Checklist

  • Verify the invariant before writing a loop: know exactly what every pointer, index, or auxiliary structure guarantees at each step of Graph Traversal: BFS & DFS (Number of Islands).
  • Check language mutability rules: in JavaScript and Python, strings are immutable, so in-place character algorithms expect a mutable array (char[]) or list[str].
  • Trace small boundary cases manually (empty input, 1 element, 2 elements, duplicates) before declaring the solution complete.
  • Explain both Time (O(M × N)) and Space (O(M × N)) complexity clearly, including recursion stack or helper allocations.

Top 10 Frequently Asked Questions (Candidates & Hiring Companies)

1. Why does Graph Traversal: BFS & DFS (Number of Islands) run in O(M × N) time and O(M × N) space?

Traverse connected components in a 2D matrix or graph. BFS uses a queue to expand layer-by-layer; DFS uses recursion to drill down to boundaries and mark cells visited in-place. Each step makes monotonic progress toward termination without revisiting eliminated work, yielding O(M × N) runtime while keeping extra working memory bounded to O(M × N).

2. What is the classic benchmark problem used to test Graph Traversal: BFS & DFS (Number of Islands) in interviews?

Interviewers frequently introduce this pattern through "Number of Islands (LeetCode 200)" (Graphs & Matrices), and then ask follow-ups testing boundary inputs, streaming data, or tighter space constraints.

3. What is the most common bug candidates make when implementing Graph Traversal: BFS & DFS (Number of Islands)?

The top mistakes are off-by-one loop conditions (< vs <=), forgetting empty or single-element base cases, mutating immutable strings directly instead of working on an array/list, and missing state resets across iterations.

4. Where is Graph Traversal: BFS & DFS (Number of Islands) used in real-world production software systems?

Beyond coding interviews, Graph Traversal: BFS & DFS (Number of Islands) directly underlies production workloads such as: Image processing flood-fill (paint bucket), garbage collection reachability (mark-and-sweep), and cloud VPC cluster isolation analysis.

5. What follow-up constraints do senior interviewers add after solving Number of Islands (LeetCode 200)?

Expect interviewers to ask how your approach behaves if the input exceeds single-machine RAM, arrives as an unbounded stream, contains duplicate keys or Unicode multi-byte tokens, or must run concurrently without lock contention.

6. How do interviewers at Google, Amazon, Meta, and Microsoft grade DSA solutions?

Hiring committees grade four independent signals: (1) clarifying ambiguous constraints and edge cases before coding, (2) selecting an optimal pattern and stating exact Time and Space Big-O trade-offs, (3) writing clean bug-free JavaScript or Python code while narrating invariants, and (4) walking through a manual dry-run trace to catch off-by-one errors.

7. Should I code DSA interviews in Python or JavaScript?

Use whichever language you write most fluently under time pressure. Python offers concise tuple unpacking, heapq, collections.deque, and slicing—ideal for rapid LeetCode and data engineering screens. JavaScript is preferred for frontend and full-stack product loops, though remember JS has no built-in heap and strings are immutable just like in Python.

8. How do you identify which of the 24 DSA patterns applies within the first 2 minutes?

Look at input structure and constraints: sorted arrays or target pairs signal Two Pointers or Binary Search; contiguous subarray/substring bounds point to Sliding Window; parent-child or dependency hierarchies use DFS/BFS or Trie; top-K / streaming medians use Min-Heaps; and overlapping subproblems with optimal substructure require Memoization or Tabulation DP.

9. What edge cases do interviewers test on almost every DSA coding round?

Expect reviewers to test empty inputs ([] or ""), single-element inputs, duplicate keys, negative or zero values, already-sorted or reverse-sorted arrays, disconnected graphs or cycles, and maximum constraint bounds (e.g., N = 10^5 where O(N^2) times out).

10. Why do Staff interviews still ask core DSA patterns when AI coding tools exist?

AI can autocomplete syntax, but engineers still own asymptotic latency, memory footprints, and production failure modes. Knowing why O(1) space in-place mutation or O(log N) search matters prevents database timeouts, event-loop stalls, and unexpected cloud compute bills.

Explore All 24 Interactive DSA Patterns & Complexity Tools