39. Huffman Encoding

Hard

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: text = "hello"

Output:

{
  "h": "100",
  "e": "101",
  "l": "0",
  "o": "11"
}

Explanation: The character 'l' appears most frequently, so it gets the shortest code '0'. The other characters get longer codes based on their frequencies.

Example 2:

Input: text = "aaaaabbc"

Output:

{
  "a": "0",
  "b": "10",
  "c": "11"
}

Explanation: The character 'a' appears most frequently and gets the shortest code '0'.

Example 3:

Input: text = "",

Output: {}

Explanation: Empty string will result in empty code map.

Constraints:

•
•

Time Complexity

O(n log n)

Space Complexity

O(n)

39. Huffman Encoding

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases

39. Huffman Encoding

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases