Huffman Decoding-1 | Practice | GeeksforGeeks

Geeksforgeeks

Sign In

Leaderboard

Showing:

Handle	Score
@Ibrahim Nash	5725
@blackshadows	5685
@akhayrutdinov	5111
@mb1973	4989
@Quandray	4908
@saiujwal13083	4156
@sanjay05	3762
@marius_valentin_dragoi	3511
@sushant_a	3453
@KshamaGupta	3318
@the_coder95	3302
Complete Leaderboard
Handle	Score
@avaiesshaik782	782
@arpitsatnalika	773
@tujhekya	602
@prakharxyz	597
@code_it_	591
@iamronak	505
@imnm	500
@pradeepkumarjad	488
@satyam0460	481
@Rahul Jadhav 1	466
@sivanandh03	464
Complete Leaderboard

Huffman Decoding-1

Easy Accuracy: 62.57% Submissions: 4074 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.

Editorial

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

Yes

All Submissions

My Submissions:

Login to access your submissions.

Huffman Decoding-1

Output Window