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
Year of the Cow#11211
Medium
Stone Game#11213
Hard
Walking Home#11221
Very easy
Paired Up (Gold)#11225
Very hard
HILO (Gold)#11226
Very hard
Acowdemia I#11231
Very easy
Acowdemia#11236
Medium
Portals#11238
Easy
Discount Coupons#11253
Very easy
Max or Min#11274
Medium
Projection#11280
Hard
Tree Permutations#11281
Very hard