LeetCode 2251: Number of Flowers in Full Bloom Solution

Master LeetCode problem 2251 (Number of Flowers in Full Bloom), a hard challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2251. Number of Flowers in Full Bloom

Hard

Array Hash Table Binary Search Sorting Prefix Sum Ordered Set

Problem Explanation

Explanation:

To solve this problem, we can first preprocess the flower bloom times by sorting them based on their start times. Then, we can iterate over the people's arrival times and use a binary search to find the number of flowers in bloom at that specific time.

Sort the flowers array based on the start times.
Iterate over the people array.
For each person, use binary search to find the number of flowers in bloom at the arrival time.
Return the count of flowers in bloom for each person.

Time Complexity:

The time complexity of this solution is O(n log n) for sorting the flowers array and O(n log n) for binary search for each person, where n is the number of flowers.

Space Complexity:

The space complexity is O(n) for storing the sorted flowers array.

Solution Code

import java.util.*;

class Solution {
    public int[] numOfBloomFlowers(int[][] flowers, int[] people) {
        Arrays.sort(flowers, (a, b) -> a[0] - b[0]);
        int n = flowers.length;
        int[] result = new int[people.length];
        
        for (int i = 0; i < people.length; i++) {
            int count = binarySearch(flowers, people[i]);
            result[i] = count;
        }
        
        return result;
    }
    
    private int binarySearch(int[][] flowers, int time) {
        int count = 0;
        for (int[] flower : flowers) {
            if (flower[0] <= time && time <= flower[1]) {
                count++;
            }
        }
        return count;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2251 (Number of Flowers in Full Bloom)?

This page provides optimized solutions for LeetCode problem 2251 (Number of Flowers in Full Bloom) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2251 (Number of Flowers in Full Bloom)?

The time complexity for LeetCode 2251 (Number of Flowers in Full Bloom) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2251 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2251 in Java, C++, or Python.

Back to LeetCode Solutions