Search⌘ K

DIY: Flood Fill

Explore how to implement the flood fill algorithm by updating connected pixels of the same color in a 2D image array. This lesson helps you understand image manipulation using 4-directional connectivity, an important problem type in coding interviews, enhancing your problem-solving skills in real-world scenarios.

Problem statement

An image is represented by a 2-D array of integers, each integer represents a pixel value of the image between 0 and 65535.

Given a coordinate (sr, sc) representing the flood fill’s starting pixel (row and column) and a pixel value newColor, flood fill ...