Solution: Flood Fill

Explore how to apply backtracking and depth-first search to solve the flood fill problem on a 2D grid. Understand how to update connected pixels sharing the same original color by recursively checking neighbors, handling boundaries, and modifying the grid efficiently. This lesson helps you grasp the algorithm's core logic, time complexity, and implementation details in JavaScript.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

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:

If the pixel at (sr, sc) already has the value target, return the original grid without any changes.
Otherwise, start at the pixel grid[sr][sc] and change its color to the given color target. ...