The Huffman Decoder

Decode a Huffman-encoded bitstring into readable text using a given list of character-to-code mappings, including a special [newline] token for line breaks. This problem spotlights real-world data compression and careful parsing, and has appeared in Wolverine Trading interviews.

Example

Unlock to view complete problem details

and practice with sample input/output

Was this article helpful?

View Test Cases & Run Code requires membership

Input Variables

Execution Result: