InterviewDB Experience

Arithmetic Encoding: Implement Arithmetic Coding for Lossless Data Compression

Interview Experience

Problem Arithmetic coding compresses a message into a single number in [0, 1) based on character probabilities. Given a symbol frequency table and a message, implement an encoder and decoder. Example Follow-ups Floating-point precision limits the message length. How does integer arithmetic coding solve this? How does arithmetic coding compare to Huffman coding in compression ratio? How do you handle symbols not seen in the frequency table (zero-probability problem)?

Full Details

🔒

Unlock all Jane Street questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a candidate experience report from a jane street interview during the phone round.

It covers the following topics: Coding, Onsite, Phone .