I'm going to be honest, I really love your explanations. You do it best! Everytime I have any problem trying to understand any blind 75 or the 150 list problem I always search "[input problem] Greg Hogg". I hope you keep it up and I look forward to learning more from your future videos!
Thank you for providing such a great explanation. This is the most clearest explanation I 've seen on the entire internet. Not only did you provide the solution, but you also explained the underlying concepts!
Thanks, this was very helpful. I paused after you described the approach and then implemented my own version of the solution based on your strategy. My differences were: 1. Using recursive DFS to save on a stack. 2. I doubled the use of my old-to-new mapping dict as a visited set. Because the keys to the dict have to be unique anyway. Not sure that significantly improves efficiency or anything but it did work.
Master Data Structures & Algorithms For FREE at AlgoMap.io!
I'm going to be honest, I really love your explanations. You do it best! Everytime I have any problem trying to understand any blind 75 or the 150 list problem I always search "[input problem] Greg Hogg". I hope you keep it up and I look forward to learning more from your future videos!
Thank you for providing such a great explanation. This is the most clearest explanation I 've seen on the entire internet. Not only did you provide the solution, but you also explained the underlying concepts!
Glad to hear it ☺️☺️
Thanks, this was very helpful. I paused after you described the approach and then implemented my own version of the solution based on your strategy.
My differences were:
1. Using recursive DFS to save on a stack.
2. I doubled the use of my old-to-new mapping dict as a visited set. Because the keys to the dict have to be unique anyway. Not sure that significantly improves efficiency or anything but it did work.
I like your way of teaching bro Comment from India
Thank you so much! Reply from Toronto :)
the explanation was really clear, thanks!
You're flying through this!!
@@GregHogg thanks Greg, your videos are very well explained, I have learned a lot
@@christianjt7018 that's amazing 🤩🤩
hash_map[node] = Node(val=node.val) why it has the rigth to access neighbours atteibute? Why just not Node() bro can you explain, I don't understand
Isn't it better to use DFS here instead?
He is using DFS, there's just two passes instead of one
he's using DFS but using Stack instead of recursion. Iterative approaches are faster than recursive approaches
I also reply from India
Indian