Absolutely beautiful videos... All of them. They deliver understanding (and intuition) in the most concise, complete and elegant way, giving you tools to apply to other problems. I can't tell that other leetcode breakdowns on youtube deliver that. Thanks a lot!
The same code works if you build the graphs adjacency list normally. So instead of generating the pair [0, 1] as 0 -> 1 you can also do 1 -> 0 (which makes more sense to me since to take class 0 you would first start at class 1). So in this case the line g[a].append(b) can be written g[b].append(a)
Master Data Structures & Algorithms For FREE at AlgoMap.io!
I was able to solve it just by understanding the example portion of your video.Truly amazing explanation! Keep up the good work!
That's amazing!
Absolutely beautiful videos... All of them. They deliver understanding (and intuition) in the most concise, complete and elegant way, giving you tools to apply to other problems. I can't tell that other leetcode breakdowns on youtube deliver that. Thanks a lot!
The same code works if you build the graphs adjacency list normally. So instead of generating the pair [0, 1] as 0 -> 1 you can also do 1 -> 0 (which makes more sense to me since to take class 0 you would first start at class 1). So in this case the line g[a].append(b) can be written g[b].append(a)
is the efficient the same when using an adjacency list here?
thanks
whats with the all caps variable names lol
Constants are usually uppercase
@@GregHogg noted sir!