Greedy algorithms
Problems on greedy algorithms, including scheduling intervals and deadlines, giving change with coins, choosing items by value per unit, merging with the cheapest cost, covering segments with points, and building the largest or smallest number from digits.
The sorting article in the Basics section and the priority queue article cover the usual tools. Related problem sets are under Sorting, Priority queue and Constructive algorithms.
Problems
Lemonade Line#10385
Medium
Convention#10396
Medium
Convention II#10397
Medium
Sort It Out#10403
Very hard
Hoofball#10406
Easy
Rest Stops#10408
Medium
Snow Boots (Gold)#10411
Medium
Lifeguards (Bronze)#10418
Very easy
Rental Service#10421
Medium
Sprinklers#10428
Hard
Boxes#10454
Medium
Subsequence#10465
Medium
Tug of war#10494
Medium
Modern Art#10523
Medium