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 UA-cam and found this video, this video gives me a very clean concepts of this question for what to do. Thank you so much!
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 ) 😭😭
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.
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!!
BFS - def bfs(row: int, col: int) -> None: queue = [(row, col)] grid[row][col] = '0' for row, col in queue: # Search Up, right, down, left for dx, dy in [(-1, 0), (0, 1), (1, 0), (0, -1)] : # Up, right, down, left r , c = row + dx, col + dy # Check that the target cell is valid and cell value is '1' if 0
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
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?
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
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
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.
@@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 😃)
Master Data Structures & Algorithms For FREE at AlgoMap.io!
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 UA-cam and found this video, this video gives me a very clean concepts of this question for what to do. Thank you so much!
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 ) 😭😭
Totally love the explanation. Your voice is very stable so really like it !
Very glad to hear it!
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.
Did you move forward?
did you
Bro, updates.
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
Amazing
Incredible explanation! I was really struggling with comprehending this one. Thank you!
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!!
you turned this question easier, thanks for the explanation, really clear solution
Best explanation for this problem everr!!! You made it so clear. Thank you sir!!
This really helped me out, been struggling w bfs/dfs and you cleared it up thanks!
Best explanation I've found on this
Dude!!!!! thanks so much your explanations are very clean and simple!
Thanks Greg for the proper & detailed explanation espl updating grid position :) That helped me after looking up solution from 3 more places before.
Amazing ❤️
Holy fuck, that crystal clear explanation. mad respect
Amazing explanation Greg!
BFS -
def bfs(row: int, col: int) -> None:
queue = [(row, col)]
grid[row][col] = '0'
for row, col in queue:
# Search Up, right, down, left
for dx, dy in [(-1, 0), (0, 1), (1, 0), (0, -1)] : # Up, right, down, left
r , c = row + dx, col + dy
# Check that the target cell is valid and cell value is '1'
if 0
Studying for Zon SDEI this is amazing
After watching it for few days, I am like:
Oh yeah, this is a cool problem, now that I understand.
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
Amazing explanation 😄 thanks a lot
Awesome Explanation my fav Canadian man
🇨🇦🇨🇦
Thanks bro, I loved the explanation
Thank you bro, wish you all the best
You too!
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?
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
@@josephsypniewski3443 Got it, thanks a lot for the explanation!
How did you say the time complexity is O(2 m*n)
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
C++ will always be faster. But interviewers don't care what language you use.
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.
What 😂
@@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 😃)
Most asked question by meta
I search a problem, I don't it from Greg Hogg, I become sad.
I don't want to watch it from anyone else. 😬