Search lands in PR-5.1 (Pagefind).

Data Structures & Algorithms

Greedy Selection

Sort by end, keep the one that ends earliest — activity-selection and arrow-minimisation.

  1. Problem 01 Non-Overlapping Intervals Sort by end, greedily keep the earliest-finishing interval. 6 min
  2. Problem 02 Minimum Arrows to Burst Balloons Sort by end; each group of overlapping intervals needs one arrow. 5 min