Course Schedule (Topological Sort)

Problem

Given n courses and prerequisite pairs, return true if all courses can be finished (no cycle).

Example

n=2, prereq=[[1,0]] -> true
n=2, prereq=[[1,0],[0,1]] -> false

Constraints

• 1 ≤ n ≤ 2000

Follow-up

Return a valid ordering. Relate it to scheduling dependent manufacturing/firmware build steps.