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
The ABCD Murderer#9747
Very hard
Jurassic Jigsaw#9876
Medium
SpaceX#10030
Easy
T1. Calculator ET#10073
Very easy
Mad scientist#10118
Medium
Delegation (Gold)#10125
Very hard
Cell Phone Network#10156
Medium
Rats#10214
Very easy
Emma and the Strange Circle#10222
Very hard
Dmytro and Bottles#10249
Very easy
Trio#10250
Very easy
Cakes#10251
Very easy
Pyramid#10257
Very easy
Bounty for Heads#10259
Very easy