Graphs: topological sort with cycle detection

← Courses›Interview PrepModule 3 · Trees, Graphs, BFS/DFS›Graphs: topological sort with cycle detectionwrite48 / 100

Task

📝 **Question:** Implement `topo(graph)` for a DAG (raise ValueError on cycle). Use `{'a':['b','c'],'b':['d'],'c':['d'],'d':[]}`. Print one valid topo order.

📋 Pick the right answer.

💡 **Hint:** Re-read the theory above if unsure.

Keep going

🎯write

Union-Find with path compression

🎯writeFREE

Two pointers: pair sum

🎯write

Two pointers: palindrome check

🤖predictFREE

Prerequisites — what you should know before this track

⚡predictFREE

Prerequisites — what you should know before this track

✏️ Write your code here

🐍

Loading Python...

First visit only — ~5-10s. Stays cached afterward.

📊 Result

Press Run to see result...

Keep going

💬 Discussion