Huffman Decoding-1

Easy Accuracy: 62.93% Submissions: 3801 Points: 2

The task is to implement Huffman Encoding and Decoding.

Input:
First line consists of T test cases. Only line of every test case consists of String S.

Output:
Single line output, return the Decoded String.

Constraints:
1<=T<=100
2<=S<=1000

Example:
Input:
2
abc
geeksforgeeks
Output:
abc
geeksforgeeks

Topic Tags

Character Encoding Greedy Heap

to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes