Character Frequency Counting in DSA C++ - Build from Scratch

Character Frequency Counting

📖 Scenario: You are working on a text analysis tool that helps writers understand how often each letter appears in their writing. This can help them spot overused letters or patterns.

🎯 Goal: Build a program that counts how many times each character appears in a given string.

📋 What You'll Learn

Create a string variable with a specific sentence.

Create a map to store character frequencies.

Use a loop to count each character's frequency.

Print the frequency of each character.

💡 Why This Matters

🌍 Real World

Counting character frequency is useful in text analysis, cryptography, and data compression.

💼 Career

Understanding how to count and store frequencies helps in roles like software development, data analysis, and natural language processing.

1

Create the input string

Create a string variable called text and set it to the exact value "hello world".

DSA C++

# Create a string variable called text with value "hello world"
# Your code here

Hint

Use std::string to create the variable and assign the exact text.

2

Create a map to store frequencies

Create a std::map<char, int> variable called freq to store the frequency of each character.

DSA C++

std::string text = "hello world";
// Create a map called freq to store character frequencies
# Your code here

Hint

Use std::map<char, int> to create the frequency map.

3

Count the frequency of each character

Use a for loop with variable ch to iterate over each character in text and increase the count of ch in freq by 1.

DSA C++

std::string text = "hello world";
std::map freq;
// Use a for loop to count each character's frequency
# Your code here

Hint

Use a range-based for loop to go through each character and update the map.

4

Print the frequency of each character

Use a for loop with variables ch and count to iterate over freq and print each character and its frequency in the format ch: count.

DSA C++

std::string text = "hello world";
std::map freq;
for (char ch : text) {
    freq[ch]++;
}
// Print each character and its frequency
# Your code here

Hint

Use a loop to print each character and its count on a new line.

Practice

1. What does character frequency counting in a string help us find?

easy

A. The length of the string

B. The position of a character in the string

C. The first character of the string

D. How many times each character appears in the string

Solution

1. Step 1: Understand character frequency counting

   It means counting how many times each character shows up in the string.

2. Step 2: Compare with options

   Only How many times each character appears in the string matches this meaning exactly.

3. Final Answer:

   How many times each character appears in the string -> Option D

4. Quick Check:

   Frequency counting = count characters [OK]

Hint: Frequency means count of each character [OK]

Common Mistakes:

• Confusing frequency with string length
• Thinking frequency means position
• Mixing frequency with substring extraction

2. Which of the following C++ code snippets correctly declares a map to count character frequencies?

easy

A. std::map freq;

B. std::vector freq;

C. std::map freq;

D. std::unordered_map<int> freq;

Solution

1. Step 1: Identify correct map declaration

   We need a map with key as char and value as int to count frequencies.

2. Step 2: Check each option

   std::map freq; uses std::map, which is correct. Others have wrong types or missing template parameters.

3. Final Answer:

   std::map freq; -> Option A

4. Quick Check:

   Map key=char, value=int for frequency [OK]

Hint: Map keys = characters, values = counts [OK]

Common Mistakes:

• Using vector instead of map
• Swapping key and value types
• Missing template parameters in map

3. What is the output of the following C++ code?

std::string s = "hello";
std::map freq;
for (char c : s) {
    freq[c]++;
}
for (auto &p : freq) {
    std::cout << p.first << ":" << p.second << " ";
}

medium

A. h:1 e:1 l:2 o:1

B. e:1 h:1 l:2 o:1

C. h:1 e:1 o:1 l:2

D. h:1 l:2 e:1 o:1

Solution

1. Step 1: Count characters in "hello"

   h=1, e=1, l=2, o=1

2. Step 2: Understand map iteration order

   std::map orders keys ascending by character: e, h, l, o

3. Final Answer:

   e:1 h:1 l:2 o:1 -> Option B

4. Quick Check:

   Map sorts keys alphabetically [OK]

Hint: Map prints keys sorted, not insertion order [OK]

Common Mistakes:

• Assuming insertion order output
• Mixing character counts
• Ignoring map key sorting

4. Identify the error in this code snippet for counting character frequencies:

std::string s = "abcabc";
std::map freq;
for (int i = 0; i <= s.size(); i++) {
    freq[s[i]]++;
}

medium

A. freq[s[i]]++ should be freq[s[i]] = 1

B. Map should be unordered_map for frequency counting

C. Loop condition should be i < s.size(), not <= s.size()

D. String s should be a vector<char>

Solution

1. Step 1: Check loop boundary

   Loop runs from i=0 to i <= s.size(), which accesses s[s.size()] out of bounds.

2. Step 2: Correct loop condition

   It should be i < s.size() to avoid out-of-range access.

3. Final Answer:

   Loop condition should be i < s.size(), not <= s.size() -> Option C

4. Quick Check:

   Index must be less than string length [OK]

Hint: Use <, not <=, for string indexing loops [OK]

Common Mistakes:

• Off-by-one error in loop
• Wrong map type confusion
• Incorrect frequency increment logic

5. Given a string, how can you find the character with the highest frequency using C++ STL containers?

hard

A. Count frequencies in a map, then iterate to find max frequency character

B. Sort the string and pick the first character

C. Use a vector<char> to store characters and pick the last one

D. Use a queue to enqueue characters and dequeue the max frequency

Solution

1. Step 1: Count character frequencies using a map

   Use std::map to count how many times each character appears.

2. Step 2: Iterate map to find character with max frequency

   Loop through map entries to track character with highest count.

3. Final Answer:

   Count frequencies in a map, then iterate to find max frequency character -> Option A

4. Quick Check:

   Map + iteration finds max frequency char [OK]

Hint: Use map to count, then find max by scanning map [OK]

Common Mistakes:

• Sorting string doesn't give max frequency
• Using vector or queue wrongly
• Not iterating to find max frequency