Leetcode 1482. Minimum Number of Days to Make m Bouquets

Find the minimum day such that you can form at least m bouquets, each requiring k adjacent flowers that have bloomed (return -1 if impossible, e.g., when m*k > n). This is typically solved by binary searching the day and greedily scanning for k-length contiguous bloomed segments to check feasibility.