LeetCode 207 & 210: Course Schedule I & II | Topological Sort | Kahn's algorithm - Interview Ep 78

[@Sasha-fb6vb]

Best explanation I've ever seen ♥️

[@FisherCoder]

Glad it was helpful!

[@Mauglus]

Love your algorithm explanations! Keep it going :)

[@FisherCoder]

Glad you like them! Will do!

[@navinkachhela7171]

thank you so much

[@FisherCoder]

You're welcome!

[@shauryabavishi3874]

It is really helpful video, explained in easy manner!

[@FisherCoder]

Glad it was helpful!

[@GorgeousPuree]

Great explanation, I rewatched this video few times to finally understand this algo... Wouldn't it be more efficient to create topoMap and instead of iterating through every prerequisite in the while loop, iterate only through courses that are children of the currently iterated course?

[@warzone7741]

thanks, clear explanation and slides.

[@FisherCoder]

Glad it was helpful!

[@harshavardhanm7091]

thank you so much, very clearly explained

[@FisherCoder]

Glad it was helpful!

[@aamirjamal6833]

Thanks! Subscribed! 😊

[@FisherCoder]

Awesome! Thank you!

[@nimanizky]

Great tutorial, You should do thia tutorial for another algo such as dp or backtracking

[@FisherCoder]

Thanks, will do!

[@kma1138]

GOATED

[@The8merp]

Good video, just wish it was edited to make it shorter, perhaps by cutting out some of the example explanations such as at 2:30 and 4:47. The video just drags at these points. Also adding some timestamps to the video for the various sections would help people quickly navigate to the part of the video they care about.

[@FisherCoder]

Good call!

[@rydmerlin]

Is it significant to get the iterator every time thru the while?

[@toekneema]

Great explanation! I have one question though, can you describe a situation when there will be left over indegrees: I don't really understand when that will ever happen. Seems like as long as it's not a cycle, all the edges should be able to be visited so all the indegrees would be 0 at the end

[@skuller1225]

I have the same question

[@shawnx7806]

if there is a left over indegree that means there is some kind of cycle in the graph right? I am new to this as well

[@RohitSharma-ji2qh]

is it ideal to store courses indegree in array when constraint for courses are 10^5. In worst case, we need to store 10^5 courses indegrees.