BETA

Difficulty Level:

Easy

Total Submissions: 78 Accuracy:

58.97%

Huffman Decoding-1 (Function Problem)
         

Given a encoded string, your task is to print the decoded String.

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

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Raj Seth


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.