Course Schedule — Medium Coding Interview Question

Determine if you can finish all numCourses given prerequisite pairs [a, b].

Example

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

Output: true

Constraints

• 1 <= numCourses <= 2000

Topics & Companies

Topics: graphs, topological-sort

Asked by: Amazon, Google

Optimal Solution Complexity

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

Practice more

• All DSA Problems
• DSA Patterns