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
Weird Coloring#3491
Medium
Sudoku#3524
Easy
AYBABTU#3561
Hard
Billiards Sorting#3562
Very hard
Play in Basic#3566
Very hard
Skyland#3567
Hard
Two Famous Companies#3589
Very hard
Butterfly#3594
Hard
Sky Jump#3600
Very hard
Where to go?#3610
Medium
Simple Monotony#3691
Very easy
Golden sand#3736
Medium
Planting Tree#3792
Very hard
Queue#3809
Very easy
Line analysis#3815
Medium