Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in JavaScript

Solution: Flood Fill

Explore the flood fill algorithm for a 2D grid to change connected pixels of the same color recursively using depth-first search. Understand how backtracking ensures only valid, connected areas are filled with the target color. This lesson helps you master grid traversal and recursion techniques critical for coding interviews.

We'll cover the following...

Statement

You are given a 2D grid of size m x n, where grid[i][j] represents the pixel value at position (i, j).

Additionally, you are given three integers:

  • sr: The row index of the starting pixel

  • sc: The column index of the starting pixel

  • target: The new color to apply

Your task is to perform a flood fill starting from the pixel at position (sr, sc). Below is the flood fill process:

  1. If the pixel at (sr, sc) already has the value target, return the original grid without any changes.

  2. Otherwise, start at the pixel grid[sr][sc] and change its color to the given color target. ...