Cracking LeetCode 1482. Minimum Number of Days to Make m Bouquets with TypeScript & JavaScript

LeetCode: leetcode.com/problems/minimum...
GitHub: github.com/RuslanTsykaliak/Le...
Given the problem's constraints and requirements, it seems like a binary search could be a good approach here.
First, I'll initialize the left and right boundaries for the binary search. Then, I'll start a loop where I keep narrowing down the range of days until left is equal to right. In each iteration, I'll calculate the middle value between left and right, and then iterate over each flower's bloom day to count the number of bouquets that can be made within a certain number of days. If the count of bouquets is greater than or equal to m, I'll update the right boundary to the middle value. Otherwise, I'll update the left boundary to the middle value plus one.