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
One Piece#10889
Very hard
Calculator#10893
Easy
Коробка#10923
Very easy
Максимум#10925
Very easy
Операції#10927
Easy
Miners#10952
Medium
Delivery#10955
Easy
Wall#10958
Easy
Кристали#10969
Easy
Lumberjack villages#11033
Very hard
Marriage#11053
Hard
Snake#11061
Very easy
Mafia game#11090
Medium
Civilizations#11108
Very hard
Bouquet of Flowers for Juniors#11113
Very easy
Electronic lock#11119
Very easy
Bridges#11126
Hard