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
Christmas Express#10268
Very easy
Mountain View#10269
Medium
Columns#10281
Medium
Meetings#10288
Very easy
Milk Pumping#10290
Medium
Cereal#10308
Hard
The Moo Particle#10309
Very easy
Fence Planning#10321
Medium
I Would Walk 500 Miles#10323
Very hard
Sleepy Cow Sorting (Bronze)#10330
Very easy
Mountain View#10334
Medium
Train Tracking 2#10340
Very hard
Measuring Traffic#10343
Medium
Dishwashing#10348
Very hard
Painting the Barn (Gold)#10349
Very hard
Cossack Vus and the Shop#10355
Very easy
Mr. A's Magic Balls#10363
Very hard
Cowntagion#10367
Hard