Topological Sort

Category: Graphs

Difficulty: intermediate

Description: Kahn's algorithm for DAG ordering

Time Complexity: O(V+E)

Space Complexity: O(V)

Related LeetCode Problems

• 207. Course Schedule (Medium)
• 210. Course Schedule II (Medium)
• 269. Alien Dictionary (Hard)
• 1462. Course Schedule IV (Medium)
• 1190. Reverse Substrings Between Each Pair of Parentheses (Medium)
• 1203. Sort Items by Groups Respecting Dependencies (Hard)
• 310. Minimum Height Trees (Medium)
• 997. Find the Town Judge (Easy)