Huffman Coding Challenge

Given an array ARR of integers containing 'N' elements where each element denotes the frequency of a character in a message composed of 'N' alphabets of an alien language, your task is to find the Huffman codes for these alphabets.

Ensure the following for Huffman codes:

1) All codes should be binary strings.
2) Each code can distinctly identify its corresponding character.
3) Minimize the total number of bits used for the message.

Example:

Input:

ARR = [1, 4, 2]

Output:

Possible Huffman Codes: ['10', '0', '11']

Explanation:

Other valid codes could be ['01', '1', '00'], ['00', '1', '01'], etc. Invalid codes include ['1', '0', '01'], ['1', '10', '0'] due to non-uniqueness or other constraints.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 104
• 1 <= ARR[i] <= 104
• Time Limit: 1 sec

Input Format:

The first line contains an integer 'T', the number of test cases.
The next 'T' lines contain two lines each: first 'N', the number of elements in 'ARR'; second 'N' space-separated integers representing the elements of 'ARR'.

Output Format:

The checker will print 1 if the Huffman codes generated are valid and adhere to the specified rules, else it will print 0.

Note:

You do not need to print anything. It is managed for you. Implement the solution function only.