Status: IN
Greedy strategies across the repo are accompanied by explicit correctness arguments — prefix-free code uniqueness, leftmost-digit positional weight, exchange arguments — not treated as heuristics.
Each greedy choice has a structural proof that no lookahead can improve it
Depends on (SL): greedy-scan-correct-for-prefix-free-codes, can-place-flowers-greedy-is-optimal, max-sum-greedy-correctness, max69-greedy-leftmost, min-time-typewriter-greedy-optimal