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
Interstellar Trade#6969
Medium
Polyclinic#7029
Easy
Chess#7064
Very hard
Servers#7065
Easy
EIT#7067
Easy
Balls#7091
Very easy
Sorter#7127
Hard
Dura Lex#7266
Easy
Ties#7299
Very easy
Stations#7301
Easy
School Waltz#7380
Medium
Chocolate#7390
Medium
Permutation#7392
Very hard
White hats#7415
Easy
Marriage questions#7474
Medium
Schools#7477
Medium
Buffcraft#7493
Easy
Instruction#7500
Hard