Practice0:00

Huffman · D4

Assign code lengths to minimise total encoded bits.

Frequent symbols deserve short codes. Lengths must form a valid prefix code (Kraft: Σ 2⁻ˡᵉⁿ ≤ 1). A fixed-length code wastes bits on the rare symbols.

Practice — no rating pressure. Get as close to the optimum as you can; each play teaches the pattern.

Total bits

291

Kraft

0.875

sym 3

f=30

sym 4

f=26

sym 2

f=23

sym 0

f=8

sym 5

f=5

sym 6

f=4

sym 1

f=1

Huffman — practice the decision, scored against the optimum

What does the Huffman puzzle teach?

Fixed-length codes waste bits — frequent symbols deserve short codes; Huffman's greedy is the optimal prefix code.

Why do interviews ask about this?

Huffman coding is the greedy-algorithm interview — build the optimal prefix code and explain why greedy is provably optimal here.

How is it scored?

The engine computes the provably-optimal answer for the exact instance you played (dynamic programming, shortest-path, or exhaustive search — never a heuristic) and scores your attempt as a percentage of it. No login needed to see your score.

← Arena

Practice0:00

Huffman · D4

Assign code lengths to minimise total encoded bits.

Frequent symbols deserve short codes. Lengths must form a valid prefix code (Kraft: Σ 2⁻ˡᵉⁿ ≤ 1). A fixed-length code wastes bits on the rare symbols.

Practice — no rating pressure. Get as close to the optimum as you can; each play teaches the pattern.

Total bits

291

Kraft

0.875

sym 3

f=30

sym 4

f=26

sym 2

f=23

sym 0

f=8

sym 5

f=5

sym 6

f=4

sym 1

f=1