Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Minimum Difficulty of a Job Schedule
Bookmark
Memoization
Bottom-Up DP
Monotonic Stack
Input
Example 1 (ans=7)
Example 2 (ans=-1)
Example 3 (ans=3)
Example 4
Example 5 (cache hits)
Custom
jobDifficulty
=
[6, 5, 4, 3, 2, 1]
,
d
=
2
Job Difficulties
6
0
5
1
4
2
3
3
2
4
1
5
Job Difficulties
6
0
5
1
4
2
3
3
2
4
1
5
Job Difficulties (Day 2)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
-
-
-
-
-
-
-
-
-
-
-
Call Stack
solve(0,2)
top
Job Difficulties (Day 2)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
-
-
-
-
-
-
-
-
-
-
-
Call Stack
solve(0,2)
top
Job Difficulties (Day 2)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
-
-
-
-
-
-
-
-
-
-
-
Call Stack
solve(0,2)
top
Job Difficulties (Day 1)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
-
-
-
-
-
-
-
-
-
-
-
Call Stack
solve(2,1)
solve(0,2)
top
Job Difficulties (Day 1)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
-
-
-
-
-
-
-
-
-
-
-
Call Stack
solve(3,1)
solve(0,2)
top
Job Difficulties (Day 1)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
-
-
-
-
-
-
-
-
-
-
-
Call Stack
solve(4,1)
solve(0,2)
top
Job Difficulties (Day 2)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
-
-
-
-
-
-
-
-
-
-
-
Call Stack
solve(0,2)
top
Job Difficulties (Day 2)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
-
-
-
-
-
-
-
-
-
-
-
Call Stack
solve(0,2)
top
Job Difficulties (Day 2)
6
0
5
1
4
2
3
3
2
4
1
5
memo[i][k]
1
2
0
1
2
3
4
5
-
7
-
-
-
-
-
-
-
-
-
-
algo
master
.
io
Step:
Starting Minimum Difficulty of a Job Schedule: 6 jobs, 2 days (Memoization)
0 / 28
Input
Example 1 (ans=7)
Example 2 (ans=-1)
Example 3 (ans=3)
Example 4
Example 5 (cache hits)
Custom
jobDifficulty
=
[6, 5, 4, 3, 2, 1]
,
d
=
2
0 / 28
algo
master
.
io
Step:
Starting Minimum Difficulty of a Job Schedule: 6 jobs, 2 days (Memoization)
