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
Coloring#6457
Hard
Blizzard#6479
Hard
The Swapping Game#6526
Very easy
Football#6586
Very easy
Inverting Huffman#6589
Very easy
Tornado!#6594
Medium
Frozen Rose-Heads#6619
Medium
Wedding#6675
Easy
Juice#6836
Very easy
Rotten Ropes#6840
Very easy
Fortune Team#6906
Very easy
Yungom#6909
Very easy
New Island#6910
Very easy
Sharif Super Computer#6912
Very hard
Route Change#6928
Medium
Delta Quadrant#6964
Very hard