Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Time Needed to Inform All Employees
Bookmark
Brute Force
DFS
BFS
Input
Star
Chain
Multiple levels
Custom
n
=
6
,
headID
=
2
,
manager
=
[2, 2, -1, 2, 2, 2]
,
informTime
=
[0, 0, 1, 0, 0, 0]
0
0
1
1
2
2
1
3
3
4
4
5
5
head
0
0
1
1
2
2
1
3
3
4
4
5
5
head
0
0
1
1
2
2
1
3
3
4
4
5
5
head
employee 0
climb to the head, summing manager times
0
0
1
1
2
2
1
1
3
3
4
4
5
5
head
maxTime =
1
0
0
1
1
2
2
1
1
3
3
4
4
5
5
head
+ informTime[2] =
1
0
0
1
1
2
2
1
3
3
4
4
5
5
head
employee 2
climb to the head, summing manager times
0
0
1
1
2
2
1
1
3
3
4
4
5
5
head
+ informTime[2] =
1
0
0
1
1
2
2
1
3
3
4
4
5
5
head
employee 4
climb to the head, summing manager times
0
0
1
1
2
2
1
1
3
3
4
4
5
5
head
maxTime =
1
0
0
1
1
2
2
1
1
3
3
4
4
5
5
head
+ informTime[2] =
1
0
0
1
1
1
2
2
1
0
3
3
4
4
5
5
head
return 1
minute
algo
master
.
io
Step:
Start: trace every employee's path up to the head, employee 2
0 / 19
Input
Star
Chain
Multiple levels
Custom
n
=
6
,
headID
=
2
,
manager
=
[2, 2, -1, 2, 2, 2]
,
informTime
=
[0, 0, 1, 0, 0, 0]
0 / 19
algo
master
.
io
Step:
Start: trace every employee's path up to the head, employee 2
