Flood Fill Algorithm in Graph

[Kaushan-Dutta]

• Description: The flood fill algorithm follows a straightforward process to fill a region: Start at the seed point and check its color. If the color of the current pixel or cell matches the target color, proceed; otherwise, stop. Change the color of the current pixel or cell to the replacement color.
• Problem: LeetCode 733: Flood Fill
• Complexity: Time: O(rc) Space: O(rc)
• Example: https://miro.medium.com/v2/resize:fit:1400/format:webp/1*fphlwHP4J6tk60oKyGcyKQ.png
• Language: Java and C++