Parallel Courses III (LeetCode 2050)
HardLeetCode 2050 · Topological Sort · Google, Amazon +8 · 30:40Parallel Courses III · Topological Sorting · Intuition · Dry Run · UBER · Leetcode - 2050My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 2050 Parallel Courses III by codestorywithMIK: Graphs, Hard. Topics: Array, Dynamic Programming, Graph Theory, Topological Sort. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, Dynamic Programming, Graph Theory, Topological Sort, Directed Acyclic Graph
- Patterns
- Topological Sort
- Chapter
- Graphs
- Duration
- 30:40
Related problems
- Course Schedule (LeetCode 207)
- Course Schedule-II (LeetCode 210)
- Diameter Of Undirected Graph (LeetCode 1245)
- Longest Path With Different Adjacent Characters : (Microsoft) (LeetCode 2246)
- Largest Color Value in a Directed Graph (LeetCode 1857)
- Find Eventual Safe States (LeetCode 802)
- Sort Items by Groups Respecting Dependencies (LeetCode 1203)
- All Ancestors of a Node in a Directed Acyclic Graph (LeetCode 2192)