Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Parallel Courses
Bookmark
BFS Topological Sort
DFS Longest Path
Input
Diamond
Chain
Parallel Paths
Cycle
Custom
n
=
4
,
relations
=
[[1,2],[1,3],[2,4],[3,4]]
semester 0
taken 0 / 4
sem 1
sem 2
sem 3
1
2
3
4
inDeg
0
1
0
2
0
3
0
4
queue
semester 0
taken 0 / 4
sem 1
sem 2
sem 3
1
2
3
4
inDeg
0
1
0
2
0
3
0
4
queue
semester 0
taken 0 / 4
sem 1
sem 2
sem 3
1
2
3
4
inDeg
0
1
1
2
1
3
2
4
queue
1
front / rear
semester 1
taken 1 / 4
sem 1
sem 2
sem 3
1
2
3
4
taking
inDeg
0
1
1
2
1
3
2
4
queue
semester 1
taken 1 / 4
sem 1
sem 2
sem 3
1
2
3
4
taking
inDeg
0
1
0
2
1
3
2
4
queue
2
front / rear
semester 1
taken 1 / 4
sem 1
sem 2
sem 3
1
2
3
4
taking
inDeg
0
1
0
2
0
3
2
4
queue
2
3
front
rear
semester 2
taken 1 / 4
sem 1
sem 2
sem 3
1
2
3
4
taking
inDeg
0
1
0
2
0
3
2
4
queue
3
front / rear
semester 2
taken 2 / 4
sem 1
sem 2
sem 3
1
2
3
4
taking
inDeg
0
1
0
2
0
3
1
4
queue
semester 2
taken 3 / 4
sem 1
sem 2
sem 3
1
2
3
4
taking
inDeg
0
1
0
2
0
3
0
4
queue
semester 3
taken 3 / 4
sem 1
sem 2
sem 3
1
2
3
4
inDeg
0
1
0
2
0
3
0
4
queue
4
front / rear
semester 3
taken 4 / 4
answer = 3 semesters
sem 1
sem 2
sem 3
1
2
3
4
inDeg
0
1
0
2
0
3
0
4
queue
algo
master
.
io
Step:
Start: Find minimum semesters to take all courses using BFS
0 / 25
Input
Diamond
Chain
Parallel Paths
Cycle
Custom
n
=
4
,
relations
=
[[1,2],[1,3],[2,4],[3,4]]
0 / 25
algo
master
.
io
Step:
Start: Find minimum semesters to take all courses using BFS
