Flood fill problem

[SnehaAgarwal361]

Aim

Flood fill problem, i would like to work on this issue using queues in c++

Details

An image is represented by an m x n integer grid image where image[i][j] represents the pixel value of the image.

You are also given three integers sr, sc, and newColor. You should perform a flood fill on the image starting from the pixel image[sr][sc].

To perform a flood fill, consider the starting pixel, plus any pixels connected 4-directionally to the starting pixel of the same color as the starting pixel, plus any pixels connected 4-directionally to those pixels (also with the same color), and so on. Replace the color of all of the aforementioned pixels with newColor.

Return the modified image after performing the flood fill.

Programming language

• [ ] C
• [x] C++
• [ ] Java
• [ ] Python

[SnehaAgarwal361]

Please assign me this issue under LGMSOC @Ayush7614 @sameeksharl @ravikr126

[aniket-24]

Can you assign me this issue under LGMSOC @Ayush7614 @sameeksharl @ravikr126 I can also do it in Java.

[ravikr126]

Can you assign me this issue under LGMSOC @Ayush7614 @sameeksharl @ravikr126 I can also do it in Java.

LGMSOC is over bro 🙂