Practice Parallel Courses II
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also given an array relations where relations[i] = [prevCoursei, nextCoursei], representing a prerequisite relationship between course prevCoursei and course nextCoursei: course prevCoursei has to be taken before course nextCoursei. Also, you are given the integer k. In one semester, you can take at most k courses as long as you have taken all the prerequisites in the previous semesters for the courses you are taking. Return the minimum number of semesters needed to take all courses. The testcases will be generated such that it is possible to take every course.
Source: Parallel Courses II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
n = 4, relations = [[2,1],[3,1],[1,4]], k = 2
3
# Example 2
n = 5, relations = [[2,1],[3,1],[4,1],[1,5]], k = 2
4
Constraints
Related LeetCode Problems
Practice more problems similar to Parallel Courses II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.