Depth-First Search pattern
Flood Fill
Given an image grid, a starting pixel, and a new color, repaint that pixel and every pixel reachable from it through 4-directionally adjacent pixels of the same original color, then return the modified image. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 733
- Easy
- 1 approach
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
Depth-First SearchLeetCode 733
Easy
The approach
- 01 Recursive DFS flood O(R·C)O(R·C) space
What you will learn
- How to read Flood Fill and spot the depth-first search pattern in it
- Recursive DFS flood: O(R·C) time, O(R·C) space
- The pseudocode for each approach, its line lit as the animation runs
- Practice: write your own pseudocode and get it checked
More Depth-First Search
See Flood Fill run, step by step
Sign in and this page opens on the animation, with all 18 Depth-First Search problems beside it.
DSA comes with the all labs plan and every ChaiCode batch.