# Number Of Flowers In Full Bloom: Practice Notes

Number Of Flowers In Full Bloom shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort start and end times. For each query, flowers blooming = starts <= t minus ends < t, via binary search.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O((n+q) log n).

## Common mistake

Scanning every flower per query.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI help for online coding assessments.