Zero To DSAZero To DSA
Privacy Policy
Clone GraphRotting Oranges

Course Schedule

medium
Time: O(V + E)
Space: O(V + E)

There are n courses labeled 0 to n-1. You are given prerequisites pairs [a, b] meaning you must take b before a. Determine if it's possible to finish all courses.

Constraints

  • 1 <= n <= 2000

Examples

Input: n = 2, prerequisites = [[1,0]]
Output: true
Input: n = 2, prerequisites = [[1,0],[0,1]]
Output: false
Cycle detected.