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
Matches#4088
Very easy
Binary Matrix 2#4090
Very hard
Jewel heist#4134
Medium
Plotter#4169
Hard
Christmas Lights Assembly#4171
Very easy
Olympiad#4192
Medium
Gas stations#4211
Very easy
Names#4217
Very easy
Four Gate Push#4225
Medium
Game Rigging#4226
Medium
Stepan's Task#4288
Medium
Football#4302
Hard
Rain#4307
Hard
Teams#4320
Hard
Party#4327
Very hard