Minimum Days to Make M Bouquets
Binary Search on Answers DSA practice problem on Onlearn.
Difficulty: hard.
Topics: Minimum Days to Make m Bouquets of k Adjacent Bloomed Roses, Arrays, Loops, Conditional Statements, Time Complexity, Space Complexity, Big O Notation, Brute Force, Binary Search, greedy algorithm, auxiliary functions, time complexity analysis, binary search, Greedy Strategies, Mathematical Operations.
You are given N roses, and an array arr where arr[i] denotes the day the i th rose will bloom. You can only pick already bloomed roses that are adjacent to make a bouquet. You are also told that you require exactly k adjacent bloomed roses to make a single bouquet. Find the minimum number of days required to make at least m bouquets, each containing k roses. Return 1 if it is not possible. Example 1: Example 2: Constraints: N will be the length of arr.