LeetCode #207 - Course Schedule

There are numCourses courses you have to take, labeled from 0 to numCourses - 1. Some courses may have prerequisites, forming a directed graph. Your task is to determine if you can finish all courses. If you can, return true; otherwise, return false.
Function Signature: def canFinish(numCourses: int, prerequisites: List[List[int]]) -> bool:
Example 1:
Input: numCourses = 2, prerequisites = [[1,0]]
Output: true
Explanation: There are 2 courses, and finishing course 0 allows you to take course 1.
Example 2:
Input: numCourses = 2, prerequisites = [[1,0],[0,1]]
Output: false
Explanation: There is a circular dependency between courses 0 and 1.
Constraints: 1 <= numCourses <= 2000; 0 <= prerequisites.length <= 5000; prerequisites[i].length == 2; All pairs in prerequisites are unique.