Course Schedule (DAG Validity)

Problem

Given prerequisite pairs, return whether all can be completed (no cycle).

Example

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

Constraints

• 1 ≤ n ≤ 2000

Approach

Topological sort / DFS coloring.