Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Minimum Number of Work Sessions to Finish the Tasks
Bookmark
Backtracking
Packed DP
Subset DP
Input
Standard
Medium
Small
Custom
tasks
=
[1, 2, 3]
,
sessionTime
=
3
3
T0
2
T1
1
T2
every task placed
3
T0
2
T1
1
T2
every task placed
3
T0
2
T1
1
T2
placing task 0 (3)
best = 3 · 1 call
3
T0
2
T1
1
T2
S0
3/3
placing task 1 (2)
best = 3 · 2 calls
3
T0
2
T1
1
T2
S0
3/3
placing task 1 (2)
best = 3 · 2 calls
3
T0
2
T1
1
T2
S0
3/3
S1
2/3
placing task 2 (1)
best = 3 · 3 calls
3
T0
2
T1
1
T2
S0
3/3
S1
3/3
placing task 2 (1)
best = 3 · 3 calls
3
T0
2
T1
1
T2
S0
3/3
S1
3/3
best = 2
best = 2 · 4 calls
3
T0
2
T1
1
T2
S0
3/3
S1
2/3
S2
1/3
every task placed
best = 2 · 4 calls
3
T0
2
T1
1
T2
S0
3/3
S1
2/3
every task placed
best = 2 · 5 calls
3
T0
2
T1
1
T2
minimum work sessions = 2
algo
master
.
io
Step:
Start: 3 tasks [3, 2, 1] sorted descending, sessionTime=3.
0 / 25
Input
Standard
Medium
Small
Custom
tasks
=
[1, 2, 3]
,
sessionTime
=
3
0 / 25
algo
master
.
io
Step:
Start: 3 tasks [3, 2, 1] sorted descending, sessionTime=3.
