Leetcode 1136. Parallel Courses

Given n courses and prerequisite pairs, determine the minimum number of semesters required to finish all courses if you can take any number of courses per semester as long as all their prerequisites are already completed; return -1 if a cycle makes completion impossible. This reduces to topological sorting / BFS layer-by-layer on the DAG to count semesters (or detecting cycles).