Huffman Encoding

Category: Greedy

Difficulty: advanced

Description: Optimal prefix-free encoding

Time Complexity: O(n log n)

Space Complexity: O(n)

Related LeetCode Problems

• 347. Top K Frequent Elements (Medium)
• 451. Sort Characters By Frequency (Medium)
• 767. Reorganize String (Medium)
• 264. Ugly Number II (Medium)
• 659. Split Array into Consecutive Subsequences (Medium)
• 815. Bus Routes (Hard)