Google Coding Interview Question explained | Course Schedule 2 [LeetCode 210]

In this video I explain the solution of a common coding interview question “Course Schedule 2”.
We will solve it with topological ordering.

This question is frequently asked in Google and Amazon software engineering interviews (according to LeetCode)

[OksanaSpecter]

Shiran, you made this problem look so simple. Thanks for your video, very helpful

[williamdu]

I've been stucking on this problem for at least 6 months and the videos out there are not helpful at all. However, I understood this problem in 10 minutes by watching your video. Thanks a lot!

[peakyDicers]

Great explanation! Very clear and concise and I appreciate you going over the time/space complexity + how we get to it. Thank you

[Anon-yywm]

Thanks for this explanation. Ive been struggling with this problem and when i searched other videos they all had an insane amount of lines and like 3-4 functions. It seemed too much for a coding interview. This explanation is precise and not too many lines.

[akbarshaikh]

This is the best explanation on course schedule problem. Please make full DSA course Videos or host the online course 😊

[HienNguyen-eduj]

Thank you for the great solution! Super helpful

[jlecampana]

Hello Shiran, you know I’ve heard a couple of times that the key for passing a coding interview is to have options. So, the indegrees in this case is very intuitive, but what would happen if the interviewer asks if you know a different approach, like Topological Sort. Do you think a programmer should know it? Or know many ways to solve a problem in general? Thank you, I really enjoy your way of explaining.

[shankarsaravanan]

I've a doubt, in the case where the graph is cyclic, the nodes keep getting added and popped from the queue, (which means the process keeps repeating as it is cyclic) is there any stop condition for it?

[sukritiguin]

Great explanation! Very clear and concise and I appreciate you going over the time/space complexity + how we get to it. Thank you