Master Data Structures & Algorithms For FREE at AlgoMap.io!
@CyrusWong-yq4uw4 ай бұрын
I am a Secondary student who is currently learning Python in the coding class in school and at home by myself, and I was doing this leetcode question and find this diffcult. So I looked up on KZbin and found this video, this video gives me a very clean concepts of this question for what to do. Thank you so much!
@tauicsicsics5 күн бұрын
Absolutely fantastic solution Greg, "flooding" (mark it with zeros) the island after found it is a great idea and a lot easier to understand then holding a "set". Please do all neetcode 169 and grind 169 problems, thank you!!
@MuhammadFahreza4 ай бұрын
Totally love the explanation. Your voice is very stable so really like it !
@GregHogg4 ай бұрын
Very glad to hear it!
@jameshizon48617 ай бұрын
Had this question in interview with Disney for consulting. Thankfully I at least skimmed solution beforehand. Only had ~70% of coding part but answered most of other qs & hope I move forward.
@GregHogg5 ай бұрын
Did you move forward?
@chrischika70263 ай бұрын
did you
@louisuchihatm2556Ай бұрын
Bro, updates.
@jameshizon4861Ай бұрын
Lol no they didnt think I was good fit. Perhaps my mental health from layoff getting to me. I did start a startup tho lol
@mint65473 ай бұрын
i’ve been killing my brain all day over this , not being able to comprehend some other solutions i saw but this makes so much more sense to me and it’s so well explained (have an interview tomorrow ) 😭😭
@amalnasir99402 күн бұрын
Best explanation for this problem everr!!! You made it so clear. Thank you sir!!
@VictorSantos-ih3lbАй бұрын
you turned this question easier, thanks for the explanation, really clear solution
@ahmedismail._16 күн бұрын
Best explanation I've found on this
@Jul19n3 ай бұрын
This really helped me out, been struggling w bfs/dfs and you cleared it up thanks!
@ulisesgtzrАй бұрын
Dude!!!!! thanks so much your explanations are very clean and simple!
@nerik8511 күн бұрын
Holy fuck, that crystal clear explanation. mad respect
@dhruva12214 ай бұрын
Thanks Greg for the proper & detailed explanation espl updating grid position :) That helped me after looking up solution from 3 more places before.
@GregHogg4 ай бұрын
Amazing ❤️
@ektasingh59672 ай бұрын
Amazing explanation Greg!
@saleheen1Ай бұрын
After watching it for few days, I am like: Oh yeah, this is a cool problem, now that I understand.
@JollezАй бұрын
Studying for Zon SDEI this is amazing
@mohammadamintorabi84155 ай бұрын
Can you explain the "flow" of execution. When a recursive function calls itself, the execution flow "pauses" at the line where the recursive call is made and a new instance of the dfs function starts executing from the beginning, thats little bit hard to imagine and follow in mind
@tkadosh4 ай бұрын
Amazing explanation 😄 thanks a lot
@adithyar31603 ай бұрын
Awesome Explanation my fav Canadian man
@GregHogg3 ай бұрын
🇨🇦🇨🇦
@dima.garotas3 ай бұрын
Hi, thanks for this video, just a quick question: why do we need to do dfs in up and left directions? These cells will be already considered (before (i,j) cell), because main function traverses grid from left to right, from up to buttom?
@josephsypniewski34432 ай бұрын
imagine a simple graph of [[1,1], [0,1],[1,1]] This is one island. now if we arent searching up or left (in this case only left matters but it illustrates the point). So we start at (0,0) and change it from 1 to zero, we check down and its a zero so we dont continue that path, we check right change value, check down and change value and then end the call, which leaves us with all zeroes except for the bottom right index because we never moved left from (2,1). So when our program reaches that index it will count it as another island, incorrectly giving us 2 islands instead of 1
@dima.garotas2 ай бұрын
@@josephsypniewski3443 Got it, thanks a lot for the explanation!
@GarouNguyen5 ай бұрын
Thank you bro, wish you all the best
@GregHogg5 ай бұрын
You too!
@mateustoledo28355 ай бұрын
Thanks bro, I loved the explanation
@AnjanaOuseph2 күн бұрын
How did you say the time complexity is O(2 m*n)
@yassineouahmane43087 ай бұрын
I have a question , I head that C++ is powerful than python solving problems especially in timelimit , do you think there is implementation in python that fill this gap between the two
@GregHogg7 ай бұрын
C++ will always be faster. But interviewers don't care what language you use.
@user-vany7 ай бұрын
Hi, can you make a Meta-quest browser extension In which instead of a background? There will be transparent screens, well, or translucent ones, like Vision pro.
@GregHogg7 ай бұрын
What 😂
@user-vany7 ай бұрын
@@GregHogg I wanted to say if it is possible to make such a browser extension so that there is a transparent theme instead of the background. You can give an analogy: there is a light theme, there is a dark one, and it would be cool to add a transparent theme for AR headsets directly to the browser as an extension (sorry, I just use a translator 😃)
@venky363912 күн бұрын
Most asked question by meta
@saleheen1Ай бұрын
I search a problem, I don't it from Greg Hogg, I become sad. I don't want to watch it from anyone else. 😬