Algorithms · Greedy
Choose as many large-denomination coins as possible before smaller ones.
Select as many mutually non-overlapping activities as possible.
Assign shorter binary codes to more frequent symbols.
