Course Schedule II — Medium Coding Interview Question

There are numCourses courses (0 to numCourses-1). prerequisites[i] = [ai, bi] means you must take bi before ai. Return the ordering of courses to finish all. If impossible, return an empty array.

Example

Input: numCourses = 2, prerequisites = [[1,0]]

Output: [0,1]

Constraints

• 1 ≤ numCourses ≤ 2000
• 0 ≤ prerequisites.length ≤ numCourses × (numCourses-1)

Topics & Companies

Topics: graphs

Asked by: Amazon, Google, Meta, Microsoft, Apple, Bloomberg

Optimal Solution Complexity

Time complexity: O(V+E). Space complexity: O(V+E).

Practice more

• All DSA Problems
• DSA Patterns