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

  Рет қаралды 7,964

Fisher Coder

Fisher Coder

Күн бұрын

Пікірлер: 25
@Sasha-fb6vb
@Sasha-fb6vb 2 жыл бұрын
Best explanation I've ever seen ♥️
@FisherCoder
@FisherCoder 2 жыл бұрын
Glad it was helpful!
@Mauglus
@Mauglus 4 жыл бұрын
Love your algorithm explanations! Keep it going :)
@FisherCoder
@FisherCoder 4 жыл бұрын
Glad you like them! Will do!
@GorgeousPuree
@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?
@harshavardhanm7091
@harshavardhanm7091 3 жыл бұрын
thank you so much, very clearly explained
@FisherCoder
@FisherCoder 3 жыл бұрын
Glad it was helpful!
@shauryabavishi3874
@shauryabavishi3874 3 жыл бұрын
It is really helpful video, explained in easy manner!
@FisherCoder
@FisherCoder 3 жыл бұрын
Glad it was helpful!
@warzone7741
@warzone7741 4 жыл бұрын
thanks, clear explanation and slides.
@FisherCoder
@FisherCoder 4 жыл бұрын
Glad it was helpful!
@navinkachhela7171
@navinkachhela7171 3 жыл бұрын
thank you so much
@FisherCoder
@FisherCoder 3 жыл бұрын
You're welcome!
@aamirjamal6833
@aamirjamal6833 4 жыл бұрын
Thanks! Subscribed! 😊
@FisherCoder
@FisherCoder 4 жыл бұрын
Awesome! Thank you!
@The8merp
@The8merp 4 жыл бұрын
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
@FisherCoder 4 жыл бұрын
Good call!
@nimanizky
@nimanizky 4 жыл бұрын
Great tutorial, You should do thia tutorial for another algo such as dp or backtracking
@FisherCoder
@FisherCoder 4 жыл бұрын
Thanks, will do!
@kma1138
@kma1138 3 жыл бұрын
GOATED
@toekneema
@toekneema 4 жыл бұрын
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
@skuller1225 3 жыл бұрын
I have the same question
@shawnx7806
@shawnx7806 2 жыл бұрын
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
@rydmerlin
@rydmerlin Жыл бұрын
Is it significant to get the iterator every time thru the while?
@RohitSharma-ji2qh
@RohitSharma-ji2qh 2 жыл бұрын
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.
Topological Sort | Kahn's Algorithm | Graph Theory
13:32
WilliamFiset
Рет қаралды 130 М.
When Cucumbers Meet PVC Pipe The Results Are Wild! 🤭
00:44
Crafty Buddy
Рет қаралды 63 МЛН
I Made an Electronic Chessboard Without Turns
14:32
From Scratch
Рет қаралды 225 М.
Course Schedule II - Topological Sort - Leetcode 210
17:09
NeetCode
Рет қаралды 163 М.
Top 7 Algorithms for Coding Interviews Explained SIMPLY
21:22
Codebagel
Рет қаралды 448 М.
How I Failed the Google Coding Interview (and lessons I learned)
14:24
How I would learn Leetcode if I could start over
18:03
NeetCodeIO
Рет қаралды 705 М.
Sorting Algorithms Explained Visually
9:01
Beyond Fireship
Рет қаралды 553 М.