...

/

Solution: Course Schedule

Solution: Course Schedule

Let's solve the Course Schedule problem using the Topological Sort pattern.

Statement

You are given an integer, numCourses, representing the total number of courses you need to complete, labeled from 0 to numCourses - 1.

You are also given a prerequisites array, where prerequisites[i] = [a[i], b[i]] indicates that you must take course b[i] first if you want to take the course a[i]. For example, the pair [1,0][1, 0] indicates that to take course 11, you have to first take course 00.

Return TRUE if all of the courses can be finished. Otherwise, return FALSE.

Constraints:

  • 11 \leq
...