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
Apartments#11421
Very easy
K-th Gutab#11460
Medium
Suspects#11509
Hard
Tree#11515
Hard
Clique Problem#11522
Medium
Mexor#11529
Hard
Awkward situation#11532
Medium
Competitive Programmers#11543
Very hard
The Cost of Speed Limits#11566
Very hard
Quests#11573
Very hard