DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Master Huffman coding completely — what prefix-free codes are, why Huffman coding is optimal, building the Huffman tree with a priority queue, encoding and decoding, calculating compression ratio, and applications in ZIP, JPEG, and MP3 compression.
What Is Huffman Coding?
Huffman coding is a lossless data compression algorithm that assigns variable-length binary codes to characters based on their frequencies — common characters get shorter codes, rare characters get longer codes.
Example: In English text, 'e' appears ~12.7% of the time while 'z' appears ~0.07%. Huffman gives 'e' a short code (like 01) and 'z' a long code (like 1011011).
Building the Huffman Tree
Algorithm:
- Create a leaf node for each character with its frequency
- Insert all nodes into a min-heap (by frequency)
- While heap has more than one node:
a. Extract two minimum-frequency nodes b. Create internal node with frequency = sum of both c. Make the two nodes children d. Insert new internal node back into heap
- The remaining node is the root
Example
import heapq
from collections import Counter
class HuffmanNode:
def __init__(self, char, freq):
self.char = char
self.freq = freq
self.left = None
self.right = None
def __lt__(self, other):
return self.freq < other.freq # For heap comparison
def build_huffman_tree(text):
"""
Build Huffman tree from text.
Returns root of the Huffman tree.
"""
freq = Counter(text)
# Create leaf nodes and add to min-heap
heap = [HuffmanNode(char, f) for char, f in freq.items()]
heapq.heapify(heap)
# Build tree by merging two lowest-frequency nodes
while len(heap) > 1:
left = heapq.heappop(heap) # Minimum frequency node
right = heapq.heappop(heap) # Second minimum
# Create internal node
internal = HuffmanNode(None, left.freq + right.freq)
internal.left = left
internal.right = right
heapq.heappush(heap, internal)
return heap[0] # Root of Huffman tree
Generating Codes
Example
def generate_codes(root):
"""
Traverse Huffman tree to generate binary codes.
Left edge = '0', Right edge = '1'.
"""
codes = {}
def traverse(node, current_code):
if node is None:
return
if node.char is not None: # Leaf node
codes[node.char] = current_code if current_code else '0'
return
traverse(node.left, current_code + '0')
traverse(node.right, current_code + '1')
traverse(root, '')
return codes
# Complete example
def huffman_encode(text):
if not text: return '', {}
root = build_huffman_tree(text)
codes = generate_codes(root)
# Encode the text
encoded = ''.join(codes[char] for char in text)
return encoded, codes
text = "ABRACADABRA"
encoded, codes = huffman_encode(text)
print("Character codes:")
for char, code in sorted(codes.items()):
freq = text.count(char)
print(f" '{char}': {code} (freq={freq})")
print(f"\nOriginal: {len(text) * 8} bits")
print(f"Encoded: {len(encoded)} bits")
print(f"Compression ratio: {len(encoded)/(len(text)*8):.2%}")
Output for "ABRACADABRA":
| 'A' | 0 (freq=5) ← most common, shortest code |
| 'B' | 100 (freq=2) |
| 'C' | 1010 (freq=1) |
| 'D' | 1011 (freq=1) |
| 'R' | 11 (freq=2) |
| Original | 88 bits (11 chars × 8 bits) |
| Encoded | 23 bits (5×1 + 2×3 + 1×4 + 1×4 + 2×2) |
| Compression ratio | 26.1% of original! |
Decoding
python example
def huffman_decode(encoded_bits, root):
"""
Decode Huffman-encoded binary string using the tree.
"""
decoded = []
current = root
for bit in encoded_bits:
if bit == '0':
current = current.left
else:
current = current.right
if current.char is not None: # Reached leaf
decoded.append(current.char)
current = root # Reset to root for next character
return ''.join(decoded)
root = build_huffman_tree("ABRACADABRA")
encoded, codes = huffman_encode("ABRACADABRA")
decoded = huffman_decode(encoded, root)
print(decoded) # ABRACADABRA ✓Optimality Proof
Theorem: Huffman coding produces an optimal prefix-free binary code — no other prefix-free code achieves fewer expected bits per character.
Proof (key ideas):
- In any optimal code tree, the two rarest symbols must be at the deepest level (otherwise, swap them with deeper nodes to reduce expected length).
- The two rarest symbols must be siblings (adjacent nodes with same parent) in an optimal tree.
- Therefore: combining the two rarest into a "super-symbol" and solving optimally for the reduced set gives the optimal solution for the original set.
This is exactly what Huffman's algorithm does — a greedy reduction step that is provably optimal.
Expected code length:
Example
E = Σ freq[c] × len(code[c]) for all characters c
Huffman minimizes E among all prefix-free codes.
Compression Ratio Analysis
Example
def analyze_compression(text):
"""Analyze Huffman compression performance."""
freq = Counter(text)
total = len(text)
root = build_huffman_tree(text)
codes = generate_codes(root)
# Fixed-length encoding (ceil(log2(n_chars)) bits per char)
import math
fixed_bits = math.ceil(math.log2(len(freq))) if len(freq) > 1 else 1
fixed_total = total * fixed_bits
# Huffman encoding
huffman_total = sum(freq[c] * len(codes[c]) for c in freq)
print(f"Characters: {len(freq)} unique")
print(f"Fixed-length bits per char: {fixed_bits}")
print(f"Fixed total: {fixed_total} bits")
print(f"Huffman total: {huffman_total} bits")
print(f"Compression: {huffman_total/fixed_total:.1%} of fixed-length")
analyze_compression("AABACBDAAAB")
Real-World Applications
| System | Use of Huffman |
|---|---|
| ZIP/DEFLATE | Huffman within DEFLATE compression algorithm |
| JPEG images | Huffman coding for DCT coefficients |
| MP3 audio | Huffman coding for frequency data |
| HTTP/2 | HPACK header compression uses Huffman |
| Morse code | Inspired Huffman (common letters get shorter codes) |
Summary
Huffman coding:
- Greedy choice: Always merge two lowest-frequency nodes
- Time: O(n log n) — heap operations
- Optimal: Produces minimum expected bits per symbol
- Prefix-free: Allows unambiguous decoding
- Used in: ZIP, JPEG, MP3, HTTP/2
The beauty of Huffman coding is that a simple greedy algorithm (always merge the cheapest pair) produces a provably optimal result.
*Next Lesson: Job Sequencing Problem*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Huffman Coding — Optimal Prefix-Free Data Compression.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, greedy, huffman, coding
Related Data Structures & Algorithms Topics
Continue learning this concept
Greedy AlgorithmsActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessMaster the Activity Selection Problem completely — problem definition, why sorting by end time is the correct greedy criterion, exchange argument proof, implementation variants (maximum activities, weighted interval scheduling, minimum rooms), and interval scheduling interview problems.Greedy AlgorithmsFractional Knapsack — Greedy by Value Density with ProofMaster the Fractional Knapsack problem — why greedy by value/weight ratio works, complete implementation with fractional items, proof using exchange argument, comparison with 0/1 knapsack, and real-world applications in resource allocation.Greedy AlgorithmsGreedy Interview Problems — 10 Classic Problems with Complete SolutionsSolve 10 classic greedy interview problems — gas station, candy distribution, jump game, task scheduler, assign cookies, lemonade change, boats to save people, partition labels, minimum arrows, and queue reconstruction by height — with proofs and pattern recognition.Greedy AlgorithmsGreedy Algorithms — Complete Introduction with Proof TechniquesMaster greedy algorithms from the ground up — what makes an algorithm greedy, the greedy choice property, optimal substructure, exchange argument proof technique, when greedy works vs when it fails, comparison with DP, and examples of correct and incorrect greedy choices.Greedy AlgorithmsJob Sequencing Problem — Greedy Scheduling with DeadlinesMaster the Job Sequencing Problem — scheduling jobs with deadlines and profits to maximize total profit, greedy strategy of sorting by profit, DSU-based efficient scheduling, complete implementations, proof of correctness, and variants including minimize lateness.Interview PreparationEssential Coding Patterns for InterviewsMaster the 7 most important coding patterns: sliding window, two pointers, fast & slow pointers, merge intervals, cyclic sort, top-K elements, and modified binary search.