Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Parallel Courses
Coding
- Parallel Courses III
Coding · Array · Directed Acyclic Graph · Dynamic Programming
- Execute Asynchronous Functions in Parallel
Coding
- Implement a Parallel Image Processor
Coding · Concurrency · Memory Management
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1494. Parallel Courses II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source