Dashboard
LC #207

Course Schedule

Pattern · ?AmazonGoogleMetaBloomberg

Problem

Determine if you can finish all courses given their prerequisites (detect cycle in directed graph).

Constraints

  • 1 ≤ numCourses ≤ 2000
  • 0 ≤ prerequisites.length ≤ 5000
  • prerequisites[i] = [a,b] means b must be taken before a
  • No duplicate edges

Example

Input
numCourses = 2, prerequisites = [[1,0]]
Output
true
Why
Take course 0 first, then course 1. No cycle → can finish

Spot the pattern

Which pattern cracks it?

Hints

One at a time
Solve on LeetCode ↗