Search
⌘K
Get Premium
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.