{"id":"greedy-scan-correct-for-prefix-free-codes","text":"The greedy left-to-right scan in the 1-bit/2-bit characters problem produces the unique valid decoding because `{0, 10, 11}` is a prefix-free code — no backtracking or DP is needed.","truth_value":"IN","source":"entries/2026/06/06/1-bit-and-2-bit-characters-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["greedy-algorithms-provably-optimal"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"greedy-scan-correct-for-prefix-free-codes","truth_value":"IN","reason":"premise"}]}}