Gamified challenge · Topological sort
There are n courses numbered 0 to n - 1. Each rule prereqs[i] = [a, b] says course a must be taken before course b. Rules may repeat.
Write order(n, prereqs) that returns a list of all n courses, each exactly once, in which every course comes after all of its prerequisites. Any valid order passes. If the rules loop (for example 0 before 1, 1 before 2, 2 before 0), no order exists: return an empty list.
Example: n = 4, prereqs = [[0, 1], [0, 2], [1, 3], [2, 3]] → [0, 1, 2, 3] (or [0, 2, 1, 3]).
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google