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
Expression#11312
Easy
Good Order#11314
Easy
Easy Assembly#11324
Very easy
Football#11325
Easy
Interactive Factorial Guessing#11328
Very easy
Divide into 2 groups#11339
Very easy
Azulejos#11344
Easy
Circular DNA#11347
Very hard
Miniature Golf#11353
Very hard
Цукеркоман#11360
Easy
AND-шлях#11362
Easy
Product#11375
Very hard
Buns#11379
Very easy
Сходи#11383
Hard
Шоколад#11384
Easy