Leetcode 1494. Parallel Courses II

Given n ≤ 15 courses with prerequisite relations forming a DAG, schedule up to k courses per semester (only if their prerequisites are already taken) to minimize the number of semesters. The core challenge is optimal parallel scheduling under precedence constraints, typically approached by exploring subsets of available courses (bitmask/state DP or BFS over states).