(Google)
You are given two arrays of the same length: characters (containing unique characters) and frequencies (containing the frequency of each corresponding character).
Your task is to:
Construct the Huffman Tree using the given characters and frequencies.
Traverse the constructed tree to generate the Huffman code for each character.
Return a dictionary mapping each character to its corresponding Huffman code.
You are given two arrays of the same length: characters (containing unique characters) and frequencies (containing the frequency of each corresponding character).
Your task is to:
Construct the Huffman Tree using the given characters and frequencies.
Traverse the constructed tree to generate the Huffman code for each character.
Return a dictionary mapping each character to its corresponding Huffman code.
Get one-to-one training from Google Facebook engineers
Top-notch Professionals
Learn from Facebook and Google senior engineers interviewed 100+ candidates.
Most recent interview questions and system design topics gathered from aonecode alumnus.
One-to-one online classes. Get feedbacks from real interviewers.
Customized Private Class
Already a coding expert? - Advance straight to hard interview topics of your interest.
New to the ground? - Develop basic coding skills with your own designated mentor.
Days before interview? - Focus on most important problems in target company question bank.