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
Day Streak#11135
Very hard
Imprecise Permutation Sort#11140
Very hard
Journey in Fog#11141
Very hard
Letters Q and F#11143
Medium
New White-Black Tree#11145
Very hard
Bomb disposal#11147
Very easy
Corrupted password#11148
Medium
Building escape#11150
Medium
High Card Wins#11158
Medium
High Card Low Card (Platinum)#11164
Very hard
COW#11177
Very easy
Superbull#11181
Easy