Represent the courses and prerequisites as a directed graph, where an edge from `A` to `B` means `A` is a prerequisite for `B`.

Use Kahn's algorithm for topological sorting: iteratively remove nodes with zero incoming edges (sources) and update the graph until no sources remain.

If the topological order contains all `numCourses` nodes, return it; otherwise, detect a cycle and return `[]`.