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
The MP3 Player#5344
Very hard
A Huge Tower#5346
Medium
K Best#5370
Easy
Bridges#5372
Medium
Brazen Horseflies#5383
Medium
Couples Contest#5384
Medium
Paradox with Dice#5455
Very easy
Republics#5464
Hard
Neighbors#5475
Hard
Homework#5479
Very hard
Segments#5533
Easy
Division#5545
Hard
Tunnel Network Optimization#5549
Very hard
Hey, Better Bettor#5651
Medium
Low Power#5655
Very hard
Map Tiles#5656
Very hard
Network Wars#5667
Very hard
Oil Deal#5668
Very easy
Highway Patrol#5706
Very hard
Two professors#5737
Very easy