Consider how character frequencies influence the optimal bit allocation for encoding, and why a greedy approach might be suitable here.

Recall that Huffman coding assigns shorter codes to more frequent characters—how can you leverage this to minimize the total bits used for the message?

To achieve true compute optimality, you may need to explore dynamic programming or a priority-queue-based approach to balance frequency distribution and bit allocation efficiently.