Search⌘ K
AI Features

Solution: Number of Flowers in Full Bloom

Explore how to use modified binary search to count flowers in full bloom at various arrival times by separating and sorting start and end intervals. Learn to perform quick interval counts and understand the solution's time and space complexities for efficient problem solving in coding interviews.

Statement

You are given a 0-indexed 2D integer array, flowers, where each element flowers[i] =[starti,endi]= [start_i, end_i] represents the time interval during which the ithi^{th} flower is in full bloom (inclusive).

You are also given a 0-indexed integer array, people, of size nn, where people[i] denotes the time at which the ithi^{th} person arrives to view the flowers.

For each person, determine how many flowers are in full bloom at their arrival time. Return an integer array, ans, of length nn, where ans[i] is the number of blooming flowers when the ithi^{th} person arrives.

Constraints:

  • 1 \leq flowers.length \leq ...