Pradeepsingh61/DSA_Code

[REQUEST] Add Huffman Coding in cpp

Open

#222 opened on Oct 1, 2025

View on GitHubContributor guide
 (2 comments) (0 reactions) (1 assignee)C++ (266 forks)auto 404
algorithmsenhancementhacktoberfestnew-language

Repository metrics

Stars
 (52 stars)
PR merge metrics
 (PR metrics pending)

Description

Algorithm Name

Huffman Coding

Programming Language

C++

Category

Greedy Algorithms

Difficulty Level

Medium (Intermediate)

Algorithm Description

Huffman Coding is a clever method for compressing data by assigning variable-length codes to characters based on how frequently they appear. Common characters get short binary codes, while rare characters get longer ones, similar to how 'E' is a single dot in Morse code. The algorithm builds a special binary tree by repeatedly merging the two least frequent characters until a single tree is formed. By traversing this tree, a unique, prefix-free code (where no code is the prefix of another) is generated for each character, resulting in an overall smaller file size.

References (Optional)

No response

Contribution Intent

  • I would like to implement this algorithm myself
  • I'm requesting this for someone else to implement
  • I need help implementing this algorithm

Code of Conduct

  • I agree to follow this project's Code of Conduct

Contributor guide

Research direction
Review Huffman coding algorithm: build a frequency map, construct a min heap of tree nodes, repeatedly merge two smallest nodes, generate prefix free codes via tree traversal. Implement in C++ with classes for Node and Huffman. Test with sample strings.
Tech stack
cpp
Domain
None
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++tree data structures
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70