Input:
bloomDay = [7,7,7,7,12,7,7], m = 2, k = 3
Output:
 12
Explanation: We need 2 bouquets each should have 3 flowers.
Here is the garden after the 7 and 12 days:
After day 7: [x, x, x, x, _, x, x]
We can make one bouquet of the first three flowers that bloomed. We cannot make another bouquet from the last three flowers that bloomed because they are not adjacent.
After day 12: [x, x, x, x, x, x, x]
It is obvious that we can make two bouquets in different ways.

Solution

bloomDay represents an array - where each cell represents day on which flower blooms. Each cell has just 1 flower.

We need k flowers to make 1 bouquets, and we need to form m bouquets.

Method 1 - Naive

The naive approach can be:

Initialize the range of days:
- Track the minimum and maximum days within bloomDay.
Iterate through each day:
- Check each day from the minimum bloom day to the maximum bloom day.
- On each day, count how many bouquets can be made.
Count Bouquets for Each Day:
- For each day, iterate through the bloomDay array to check if the number of consecutive bloomed flowers allows us to make m bouquets of k consecutive flowers.
Return the First Valid Day:
- Ret

Related Tags