Frequency Counter Pattern Using Hash Map in DSA C++

Mental Model

Count how many times each item appears using a map to remember counts.

Analogy: Like counting how many apples, oranges, and bananas you have by putting each fruit in a basket and adding one each time you see it.

Items: [apple, apple, orange, banana, apple]
Map: {apple: 0, orange: 0, banana: 0} ↑

Dry Run Walkthrough

Input: list: [apple, apple, orange, banana, apple]

Goal: Count how many times each fruit appears in the list

Step 1: See 'apple', add it to map with count 1

Map: {apple: 1} ↑

Why: First time seeing apple, start count at 1

Step 2: See second 'apple', increase apple count to 2

Map: {apple: 2} ↑

Why: Apple already in map, add one more

Step 3: See 'orange', add it to map with count 1

Map: {apple: 2, orange: 1} ↑

Why: First time seeing orange, start count at 1

Step 4: See 'banana', add it to map with count 1

Map: {apple: 2, orange: 1, banana: 1} ↑

Why: First time seeing banana, start count at 1

Step 5: See third 'apple', increase apple count to 3

Map: {apple: 3, orange: 1, banana: 1} ↑

Why: Apple already in map, add one more

Result:

Map: {apple: 3, orange: 1, banana: 1} ↑

Annotated Code

DSA C++

#include <iostream>
#include <unordered_map>
#include <vector>
#include <string>

using namespace std;

unordered_map<string, int> frequencyCounter(const vector<string>& items) {
    unordered_map<string, int> freqMap;
    for (const string& item : items) {
        freqMap[item]++; // increase count for this item
    }
    return freqMap;
}

int main() {
    vector<string> fruits = {"apple", "apple", "orange", "banana", "apple"};
    unordered_map<string, int> result = frequencyCounter(fruits);
    for (const auto& pair : result) {
        cout << pair.first << ": " << pair.second << "\n";
    }
    return 0;
}

freqMap[item]++; // increase count for this item

increment count for current item in map, adding it if not present

Output

apple: 3

orange: 1

banana: 1

Complexity Analysis

Time: O(n) because we look at each item once and update the map

Space: O(n) because in worst case all items are unique and stored in map

vs Alternative: Without a map, counting frequencies would require nested loops O(n^2), so map reduces time to linear

Edge Cases

empty list

returns empty map with no counts

DSA C++

for (const string& item : items) {

all items are the same

map has one key with count equal to list length

DSA C++

freqMap[item]++;

all items unique

map has all keys with count 1

DSA C++

freqMap[item]++;

When to Use This Pattern

When you need to count how many times each item appears in a list, use the frequency counter pattern with a hash map for fast counting.

Common Mistakes

Mistake: Trying to count frequencies without a map, using nested loops instead
Fix: Use a hash map to store counts and update in one pass

Mistake: Not initializing counts before incrementing
Fix: Use map's default zero value or check existence before increment

Summary

Counts how many times each item appears using a hash map.

Use when you need quick frequency counts of items in a list.

The key is to update counts in a map as you see each item once.

Practice

1. What is the main purpose of using a hash map in the Frequency Counter Pattern?

easy

A. To reverse the order of elements

B. To sort the elements in ascending order

C. To store elements without any duplicates

D. To count how many times each element appears in a collection

Solution

1. Step 1: Understand the role of a hash map

   A hash map stores key-value pairs, allowing quick lookup and update of counts.

2. Step 2: Apply to frequency counting

   We use the hash map keys as elements and values as their counts to track frequency.

3. Final Answer:

   To count how many times each element appears in a collection -> Option D

4. Quick Check:

   Frequency Counter = Counting elements [OK]

Hint: Hash map keys track elements, values track counts [OK]

Common Mistakes:

• Thinking hash map sorts elements
• Confusing frequency counting with removing duplicates
• Using hash map to reverse order

2. Which of the following is the correct syntax to declare a hash map in C++ to count frequencies of characters?

easy

A. std::vector<int> freq;

B. std::unordered_map freq;

C. std::unordered_set<char> freq;

D. std::map freq;

Solution

1. Step 1: Identify correct container for frequency counting

   We need a map from characters to integers to store counts.

2. Step 2: Check syntax correctness

   std::unordered_map freq; declares a hash map with char keys and int values.

3. Final Answer:

   std::unordered_map freq; -> Option B

4. Quick Check:

   unordered_map = frequency map [OK]

Hint: Use unordered_map for frequency counting [OK]

Common Mistakes:

• Using map with wrong key-value types
• Using unordered_set which stores only keys
• Using vector which is not a map

3. What will be the output of the following C++ code?

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

medium

A. a:2 b:2 c:2

B. a:1 b:1 c:1

C. a:3 b:3 c:3

D. a:2 b:3 c:1

Solution

1. Step 1: Count frequencies of each character in string

   Characters 'a', 'b', and 'c' each appear twice in "aabbcc".

2. Step 2: Print each character and its count

   The loop prints each character and its frequency, so output is "a:2 b:2 c:2 ".

3. Final Answer:

   a:2 b:2 c:2 -> Option A

4. Quick Check:

   Count 'a','b','c' = 2 each [OK]

Hint: Count each char's occurrences in string [OK]

Common Mistakes:

• Assuming counts are 1 instead of 2
• Mixing counts between characters
• Confusing output format

4. Identify the error in this C++ code snippet that tries to count frequencies of integers in a vector:

std::vector<int> nums = {1, 2, 2, 3};
std::unordered_map freq;
for (int i = 0; i < nums.size(); i++) {
    freq[nums[i]] = freq[nums[i]] + 1;
}
for (auto p : freq) {
    std::cout << p.first << ":" << p.second << " ";
}

medium

A. Loop should use range-based for instead of index

B. Using freq[nums[i]] = freq[nums[i]] + 1; causes runtime error

C. No error; code works correctly

D. freq should be declared as std::unordered_set<int>

Solution

1. Step 1: Check frequency counting logic

   freq[nums[i]] = freq[nums[i]] + 1; correctly increments count for each element.

2. Step 2: Verify container types and loops

   Using index loop and unordered_map is valid and works as intended.

3. Final Answer:

   No error; code works correctly -> Option C

4. Quick Check:

   Increment freq with freq[key]++ works [OK]

Hint: freq[key]++ increments count safely [OK]

Common Mistakes:

• Thinking freq[key] = freq[key] + 1 causes error
• Confusing unordered_map with unordered_set
• Believing range-based for is mandatory

5. Given two strings s1 and s2, which approach using frequency counters correctly checks if s2 is an anagram of s1?

std::unordered_map freq1, freq2;
for (char c : s1) freq1[c]++;
for (char c : s2) freq2[c]++;
// What next?

hard

A. Compare freq1 and freq2 maps for equality

B. Check if freq1 contains all keys of freq2 only

C. Check if freq2 has more keys than freq1

D. Sort s1 and s2 and compare strings

Solution

1. Step 1: Build frequency maps for both strings

   freq1 and freq2 store counts of each character in s1 and s2 respectively.

2. Step 2: Compare frequency maps for exact match

   If freq1 and freq2 are equal, s2 is an anagram of s1 because they have same chars with same counts.

3. Final Answer:

   Compare freq1 and freq2 maps for equality -> Option A

4. Quick Check:

   Anagram check = freq maps equal [OK]

Hint: Anagrams have identical frequency maps [OK]

Common Mistakes:

• Only checking keys without counts
• Assuming more keys means anagram
• Using sorting instead of frequency maps