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
Blobs` Exhibition#6189
Very easy
Minimum Sum#6198
Easy
Dark Roads#6224
Easy
Planting Trees#6249
Very easy
Boiling Vegetables#6250
Very easy
Dwarf Tower#6263
Medium
Energy Tycoon#6264
Medium
Garage#6266
Hard
Suprematism#6290
Medium
Graveyard#6297
Very easy
Festival of Colors#6365
Very hard
Digit Sum#6384
Medium
Flood-It#6404
Very easy
Chemicals Monitoring#6405
Very hard
Bad Signal#6407
Very easy
Bits Equalizer#6428
Medium