Data Compression¶

Binary Huffman coding as an optimal-merge greedy lane: repeatedly merge the two lightest trees, track weighted path length by merge sums, and recover deterministic prefix codes.

Topic slug: greedy/huffman-data-compression
Tutorial page: Open tutorial
Ladder page: Open ladder
Repo problems currently tagged here: 1
Repo companion pages: 5
Curated external problems: 1

Microtopics¶

optimal-merge
prefix-codes
weighted-path-length
min-heap-greedy
deterministic-tie-break
codeword-reconstruction

Learning Sources¶

Source	Type
Algorithms 4/e Huffman	`Course`
Algorithms 4/e data compression slides	`Course`
Cornell CS312 heaps and Huffman coding	`Course`

Repo Companion Material¶

Material	Type
Huffman / Data Compression hot sheet	`quick reference`
Template Library exact starter route	`starter route`
Huffman Coding Benchmark note	`anchor note`
Greedy overview	`family hub`
Heaps And Ordered Sets	`compare point`

Curated External Problems¶

Core¶

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Huffman Coding Benchmark	`Algorithms 4/e`	`Medium`	Data-Compression, Prefix-Codes	Heap Greedy; Tree Construction	Priority Queue; Weighted Merge Cost; Prefix Code	Optimal Merge; Min-Heap; Weighted Path Length	Canonical textbook benchmark where the whole lesson is the two-smallest merge greedy, not a production compression container.

Repo Problems¶

Code	Title	Fit	Difficulty	Pattern	Note	Solution
`HUFFMANCODING`	Huffman Coding Benchmark	`primary`	`medium`	-	Note	Code

Regeneration¶

python3 scripts/generate_problem_catalog.py