course schedule ii | course schedule 2 | course schedule II leetcode | course schedule 2 leetcode210

preview_player
Показать описание


#Graph #BFS #TopologicalSort #Indegree #Coding #Programming #Interview #Practice #Leetcode #CourseScheduleII #210 #Algorithm #Java #Preparation
Рекомендации по теме
Комментарии
Автор

We can also solve this problem using DFS approach, try out and let me if you stuck.

NareshGupta
Автор

Thanks for this video. Earlier I was so much confused but then things are clear after watching your video & going through the code.

rohitgupta
Автор

Actually using adj list is much easier to understand

aniruddhkarekar
Автор

I am confused why you used graph[p[1]].add(p[0]) at line 10 in this problem while for leetcode 207 it is graph[e[0]].add(e[1]). Could you please explain?

harshavardhanm
welcome to shbcf.ru