Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Minimum Number of Days to Make m Bouquets
Bookmark
Brute Force
Binary Search on Answer
Input
Example 1
Impossible
Example 3
Mixed days
All same
Custom
bloomDay
=
[1, 10, 3, 10, 2]
,
m
=
3
,
k
=
1
m = 3, k = 1
0
1
1
10
2
3
3
10
4
2
m = 3, k = 1
0
1
1
10
2
3
3
10
4
2
m = 3, k = 1
Testing day 1: can we make 3 bouquets?
0
1
1
10
2
3
3
10
4
2
m = 3, k = 1
Testing day 1: can we make 3 bouquets?
0
1
1
10
2
3
3
10
4
2
i
m = 3, k = 1
Testing day 1: can we make 3 bouquets?
0
1
1
10
2
3
3
10
4
2
i
m = 3, k = 1
Testing day 2: can we make 3 bouquets?
0
1
1
10
2
3
3
10
4
2
m = 3, k = 1
Testing day 2: can we make 3 bouquets?
0
1
1
10
2
3
3
10
4
2
i
m = 3, k = 1
Day 2: 2 bouquets (need 3)
0
1
1
10
2
3
3
10
4
2
m = 3, k = 1
Testing day 3: can we make 3 bouquets?
0
1
1
10
2
3
3
10
4
2
m = 3, k = 1
Testing day 3: can we make 3 bouquets?
0
1
1
10
2
3
3
10
4
2
i
m = 3, k = 1
Answer: 3 days
0
1
1
10
2
3
3
10
4
2
algo
master
.
io
Step:
Find minimum days to make 3 bouquets of 1 adjacent flowers
0 / 25
Input
Example 1
Impossible
Example 3
Mixed days
All same
Custom
bloomDay
=
[1, 10, 3, 10, 2]
,
m
=
3
,
k
=
1
0 / 25
algo
master
.
io
Step:
Find minimum days to make 3 bouquets of 1 adjacent flowers
