LeetCode #207: Course Schedule | Topological Sort

0:00 Problem Overview
2:20 Topological Sort
3:41 Kahn's Algorithm
5:35 Code Walkthrough

#leetcode #algorithms #coding #programming

[voiceofvaishhhh]

so underrated! your explanation with examples of both cases is perfect for making me understand and visualise :) Thank you!

[somtoUmeh]

This is a very beautiful explanation. Thanks a lot!!

[vigneshs]

Marvelous do more of the videos like these....

[maud]

Everything you highlight in the video is very helpful, it must take you a lot of time to edit the videos. I appreciate the effort. Keep it up :)

[DevilHunter]

One of the best explanation videos i have seen so far.. You have earned a subscriber. Well-done brother!!!❤

[naturalhitmanjr]

Very good explanation. Really helped me wrap my head around topological sorting with just this video, even though it's the first time I have heard of it.Thank you, make more!

[nqgnqnx]

what a video mahn goddamn. Please do more videos!! I keep waiting for more

[AadityaSPatil]

Incredible explanation. I loved how you showed all steps along with visualisation. Thanks a lot.

[sergeyz]

I like not only explanation, but also visualization. Well done, boy))

[AdityaSingh-nncd]

Great Explanation and very clear and understanding visualization, Thanks for helping and keep going ;)

[MehmetDemir-xiyy]

I think your graph representation is confusing. Because for [1, 0] prereq, you drawed as 0 --> 1 like 0 is dependent to 1. But in this case 1 is dependent to 0 (we have to take course 0 before course 1, so course 1 depends on course 0)

[vishalbothra]

Extremely easy to understand and visuzalize. Thanksss a lot!!

[rogerweng]

wouldn't it be better to use double ended queue instead of list to implement the 'queue' variable?

[tenshikn]

Thanks a lot for the video. I tried a BFS with a set that keeps track of already visited nodes for cycle detection but that didn't seem to work, any ideas on as to why?