LeetCode 733. Flood Fill (Algorithm Explained)

The Best Place To Learn Anything Coding Related - bit.ly/3MFZLIZ
Join my free exclusive community built to empower programmers! - www.skool.com/software-develo...
Preparing For Your Coding Interviews? Use These Resources
--------------------
(My Course) Data Structures & Algorithms for Coding Interviews - thedailybyte.dev/courses/nick
AlgoCademy - algocademy.com/?referral=nick...
Daily Coding Interview Questions - bit.ly/3xw1Sqz
10% Off Of The Best Web Hosting! - hostinger.com/nickwhite
Follow My Twitter - / nicholaswwhite
Follow My Instagram - / nickwwhite
Other Social Media
----------------------------------------------
Discord - / discord
Twitch - / nickwhitettv
TikTok - / nickwhitetiktok
LinkedIn - / nicholas-w-white
Show Support
------------------------------------------------------------------------------
Patreon - / nick_white
PayPal - paypal.me/nickwwhite?locale.x...
Become A Member - / @nickwhite
#coding #programming #softwareengineering

[@biswamohandwari6460]

You have the ultimate power to make us understand complex problems very easily that's what makes you powerful. Your the best...

[@TheBsoncarty]

Idk if you read these comments anymore, but I want to say thanks dude. These videos that you've made have been vital to my ability to understand how to approach LeetCode questions.

[@tushargupta2356]

your mistake was a good thing to learn from

[@thommy270]

Keep doing that awesome work man! Got it instantly, your explanations are very clear.

[@kishoureb6833]

Thanks a lot for the clear explanation. Just keep doing this awesome work. It really means a lot to me.

[@ahmadalk2540]

this line saved my day thanks! I was going with stackOverFlow exception without it. if ( image[sr][sc] == newColor ) return image;

[@ruibinzhang]

The most blessed thing is that I am stuck with a question, but Nick has already solved it and made a video.

[@harinijeyaraman8789]

Your videos are really helpful man ! Thanks a ton

[@vyshnavramesh9305]

1:21 number of islands, flood fill, rotten oranges.....etc basically bfs n dfs algos

[@adityap613]

You were right, this is almost identical to number of islands. Once I got this I figured that one out pretty quickly.

[@rohanbasavaraju]

Awesome video! How can you initially tell this is a DFS problem and not BFS? Additionally, do you have any useful tips for identifying if a problem will use DFS or BFS?

[@amrholo4445]

Thanks so much Also the last mistake i didn't know about it, thanks man

[@expansivegymnast1020]

Good explanation!

[@stith_pragya]

Thank You So for this wonderful video.........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@smellthel]

So there are 732 other episodes of this series?

[@jacksingermusic]

What is the time and space complexity? I'm guessing time = O(n) and space = O(1). Is that right?

[@RagingAcid]

Thanks purge

[@janneskleinau6332]

this is so cool!

[@eliastouil7686]

Thanks

[@theonly1me]

it's kinda funny how Nick is always High :D

[@ruibinzhang]

The first line is essential; otherwise, the recursion function call will go into an infinite loop.

[@ZEE-fs6hv]

just 850 problems away to complete all leet code problems😀😀

[@vishalcelestine8654]

R u doing ur UG now ?

[@mashak3765]

1692 more to go for me !

[@mohammedharoon1167]

you are just awesome

[@sanskargupta7800]

hello Sir i am getting stuck at the below test case [[0,0,0],[1,0,0]] 1 0 2

[@richa6695]

we optimize this by not visiting nodes again which are already visited right?

[@dileshsolanki2383]

@Richa won't that part get handled in the condition img[sr][sc] !=color ?

[@zn4798]

just very curious why you need to write another function, is it possible that return it in the same function? I mean use the recursive for the function floodfill

[@sfitz219]

You could put the old color in a variable at the beginning of the function, and put each of the recursive calls in an if statement, which checks if that index would be out of bounds, and if that pixel is the same color. That was what I tried first, it worked on small images on my computer, it only passed the first 16 test cases on leetcode website before getting a stack overflow on the 17th. When I added a check at the beginning that returns the unmodified image if the oldColor == newColor, it started working. I guess one of the test cases is a huge image where the pixel they try starting the flood fill at is already the color they're filling it with.

[@prathyushakadali3330]

Thanks so much for sharing this, but doesn't this cause repetition? for eg: void fill method is called for sr=1, sc=1, more than it is required.

[@prathyushakadali3330]

image[sr][sc]==newColor, condition has to be added under if condition of void fill?

[@jaideeph6985]

Will this work if the starting point is [0][0] ??

[@sanatgawade8045]

Can anyone explain why sc >= image[0].length and not sc >= image.length ?

[@jesusjurado222]

The image will not always be square, so sr is limited to the length of the encompassing array, and sc will be limited to the length the nested array.

[@rhinoara7119]

When Asians watching your videos, you know how good you are

[@DaBestn00b]

how do i get 100% faster than everyone else

[@AnandBaburajan]

4:21 boi

[@MsFerid567]

GOAT

[@drewanderson5867]

Hey the discord link is invalid, can someone send me the link, or comment it

[@MrRaminfar]

If the new color is the same as the old color, wouldn't that make an infinite recursion

[@alexwilkinson3460]

No, that's caught by line 3. It never even gets to the recursive function. "if (image[sr][sc] == newColor) return image;"

[@davidrowlands8548]

Decent!

[@dannyhd8301]

👏👏👏👏👏👏👏👏👏👏👏👏👏👏👏👏

[@radwaneberredai6622]

python problém