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
Miner#4875
Very easy
Little Chess Nim#4889
Medium
About Frogs#4918
Very easy
Factory#4951
Very hard
Mutation#4973
Easy
Camelot#4979
Very hard
Minibus#5107
Very easy
Phalanx#5113
Hard
Symposium#5114
Easy
Showcase#5160
Very hard
Chess#5177
Very hard
Duty#5231
Medium
Simple strings#5248
Medium
Your Game#5266
Easy
Grasshopper#5267
Easy
Sandboxes#5270
Very easy
Gift#5278
Hard
Permutations#5304
Medium