Topological sort (Kahn's algorithm)

← Courses›Interview PrepModule 3 · Trees, Graphs, BFS/DFS›Topological sort (Kahn's algorithm)write38 / 100

Task

📝 **Task:** Topo-sort 4 nodes with edges [[0,1],[0,2],[1,3],[2,3]]. Print the result. Expected: [0, 1, 2, 3]

📋 Edit the starter code. Tests run automatically.

💡 **Hint:** Re-read the theory if stuck.

Keep going

🎯write

Dijkstra's shortest path

🎯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