Medium
Course Schedule
Medium
96 submissions
25 coins
+100 XP
Graph
Topological Sort
Problem Description
There are `numCourses` courses labelled `0` to `numCourses - 1`. Each pair `[a, b]` in `prerequisites` means you must take `b` before `a`. Return `true` if it is possible to finish every course.
**Example 1:**
```
Input: numCourses = 2, prerequisites = [[1, 0]]
Output: true
```
**Example 2:**
```
Input: numCourses = 2, prerequisites = [[1, 0], [0, 1]]
Output: false
```
**Example 3:**
```
Input: numCourses = 3, prerequisites = []
Output: true
```
Constraints
- `1 <= numCourses <= 2000`
- `0 <= prerequisites.length <= 5000`
- All pairs are distinct.
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share