Status: IN
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.
Source: entries/2026/06/06/1-bit-and-2-bit-characters-solution.md