dsa2 min read
Merge Intervals — Sort + Linear Scan O(n log n) [Google, Meta, Amazon]
Merge all overlapping intervals. Sort by start, then merge greedily in one pass. O(n log n) time.
Read →
Intervals
6 articles
dsa2 min read
Insert Interval [Medium] — Sweep and Merge
Insert a new interval into a sorted non-overlapping list and merge any overlaps in a single sweep.
Read →
dsa2 min read
Non-overlapping Intervals [Medium] — Greedy Scheduling
Find the minimum number of intervals to remove so the rest are non-overlapping, using a greedy earliest-end-time strategy.
Read →
dsa1 min read
Minimum Number of Arrows to Burst Balloons [Medium] — Greedy Intervals
Find the minimum arrows needed to burst all balloons arranged as intervals using a greedy sort-by-end approach.
Read →
dsa1 min read
Non-overlapping Intervals — Interval Scheduling
Minimum removals to make intervals non-overlapping. Sort by end time; greedily keep earliest-ending intervals, count conflicts.
Read →
dsa1 min read
Minimum Number of Arrows to Burst Balloons
Find minimum arrows to burst all balloons (intervals). Sort by end; one arrow can burst all overlapping intervals. Count arrows needed.
Read →