- Build the adjacency list for course prerequisites. - Using indegrees, perform **Kahn’s Algorithm** (BFS Topological Sort). 1. Build adjacency list and indegree array. 2. Initialize a `reachable[n][n ...

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course ...