Course schedule — can you finish all courses? (cycle detection)

Approach

• Model prerequisites as directed graph.
• Detect cycle with DFS coloring or Kahn topological sort.

Java Solution

public boolean canFinish(int n, int[][] prereq) {
    int[] indeg = new int[n];
    List<List…