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
Olympiad#7503
Very easy
Fuel Stops#7551
Medium
Froggy Ford#7566
Hard
Generators#7567
Hard
Landscape Improved#7572
Very hard
Alex Origami Squares#7612
Very easy
Easy Arithmetic#7616
Very easy
Graph#7618
Hard
Insider's Information#7620
Very hard
Robot#7665
Very easy
Carpets#7709
Easy
Souvenirs#7715
Very easy
Bricks#7725
Easy
Fliptile#7749
Hard
Station#7758
Easy
Boxes with souvenirs#7766
Very easy
CRANE#7823
Very easy
Seven primes#7835
Medium