Minimum Number of Days to Make m Bouquets | Leetcode | Daily Challenge 1482 

Hello Everyone,
I tried explaining todays (19/06/24) Leetcode challenge i.e 1482: Minimum Number of Days to Make m Bouquets
- This problem can be solved using Binary Search on Answer using TC = O(nlogn)
logn = for Binary Search
n = for simple iteration for Monotonic function
For practice, try this problem using this concept: www.spoj.com/problems/AGGRCOW/