High Greedy Question 191 of 224

How do you burst the fewest balloons (or shoot the fewest arrows) so every interval is hit?

DSA interview set · Speak this in 60–90 seconds · Faridabad & Delhi NCR

PICTURE THIS: HOW TO EXPLAIN IT

IdeaGreedy
HowWhat happens inside
Why they askShows real use

Simple meaning

Sort intervals by end and shoot at the current end

1

WHY — Greedy instead of guessing?

Why interviewers care about Greedy:

This is a process

question about Greedy.

Panels listen for order,

trade-offs, and what you would actually do on a DSA project - not buzzwords.

Stay structured

Name the idea, why it exists, then one short example.

Close cleanly

End with when you use it and one common pitfall.

2

STEPS — What happens step by step?

Before you speak the answer, walk the interviewer through these steps:

  1. 1
    Sort intervals by end

    and shoot at the current end

  2. 2
    skip later intervals that

    start at or before that point, otherwise spend a new arrow.

  3. 3
    Sorting O(n log n),

    scan O(n).

  4. 4
    This is the same

    greedy as activity selection on finish time.

  5. 5
    Common mistake

    What juniors usually get wrong.

  6. 6
    Close

    When you pick this over the alternative.

3

EXAMPLE — See it in action

Here's a short line you can speak, broken into clear beats:

Say this line
“Sorting O(n log n), scan O(n).”
Break into beats
SortingOnlognscan
Speaking order
2987408337471632900

Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.

Key takeaway

Sort intervals by end and shoot at the current end skip later intervals that start at or before that point, otherwise spend a new arrow.

Chat with us