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
Dr Who`s Banquet#3841
Very easy
Article#3877
Very hard
The Young Networker#3882
Very easy
Bus#3924
Medium
Economy#3927
Very easy
Schedule#3929
Very easy
Cinderella#3941
Medium
Innovative Business#3947
Medium
CosmoCraft#3971
Easy
Juggler#3976
Hard
Please, go first#4012
Very easy
Tichu#4015
Hard
Cycling#4024
Very hard
Ice-Cream#4035
Medium
Peaks#4047
Hard
Fireworks in RightAngleles#4048
Very hard
Calculator#4055
Very easy
Herbarium#4062
Medium