Greedy Ladders

These ladders cover problems where the main work is choosing or maintaining a locally optimal structure with a proof that the choice stays globally safe.

Current Ladders

• Prefix Constraints
• Huffman / Data Compression

Tutorial Hub

• Greedy overview

How To Use This Section

• state the greedy choice in one sentence
• write down the invariant or exchange argument before trusting the code
• compare with DP or counting models when the greedy step feels too magical

Repo Anchors

• Lemonade Line
• Prefix Sum Addicts
• VODIVIDE
• Huffman Coding Benchmark