Frequency Counter Pattern Using Hash Map in DSA Rust

Mental Model

Count how many times each item appears by using a box with labels and counters.

Analogy: Imagine sorting coins into jars labeled by their type and counting how many coins go into each jar.

Items: [a, b, a, c, b]
HashMap:
[a] -> 2
[b] -> 2
[c] -> 1

Dry Run Walkthrough

Input: list: ['a', 'b', 'a', 'c', 'b']

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

Step 1: Start with an empty hash map

{}

Why: We need a place to store counts for each item

Step 2: See 'a', add 'a' with count 1

{'a': 1}

Why: First time seeing 'a', start count at 1

Step 3: See 'b', add 'b' with count 1

{'a': 1, 'b': 1}

Why: First time seeing 'b', start count at 1

Step 4: See 'a' again, increase 'a' count to 2

{'a': 2, 'b': 1}

Why: Increment count because 'a' appeared again

Step 5: See 'c', add 'c' with count 1

{'a': 2, 'b': 1, 'c': 1}

Why: First time seeing 'c', start count at 1

Step 6: See 'b' again, increase 'b' count to 2

{'a': 2, 'b': 2, 'c': 1}

Why: Increment count because 'b' appeared again

Result:

{'a': 2, 'b': 2, 'c': 1}

Annotated Code

DSA Rust

use std::collections::HashMap;

fn frequency_counter(items: &[char]) -> HashMap<char, usize> {
    let mut counts = HashMap::new();
    for &item in items {
        *counts.entry(item).or_insert(0) += 1; // increment count for item
    }
    counts
}

fn main() {
    let items = ['a', 'b', 'a', 'c', 'b'];
    let counts = frequency_counter(&items);
    for (item, count) in &counts {
        println!("{}: {}", item, count);
    }
}

*counts.entry(item).or_insert(0) += 1;

increment count for current item or insert 0 if not present

Output

a: 2

b: 2

c: 1

Complexity Analysis

Time: O(n) because we go through all n items once to count them

Space: O(k) where k is number of unique items because we store counts for each unique item

vs Alternative: Without a hash map, counting would require nested loops O(n^2) to count each item separately

Edge Cases

empty list

returns an empty hash map with no counts

DSA Rust

for &item in items {

list with one item

returns hash map with that item count as 1

DSA Rust

*counts.entry(item).or_insert(0) += 1;

list with all identical items

returns hash map with one key and count equal to list length

DSA Rust

*counts.entry(item).or_insert(0) += 1;

When to Use This Pattern

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

Common Mistakes

Mistake: Forgetting to initialize count to zero before incrementing
Fix: Use or_insert(0) to set initial count before adding

Mistake: Using a list or array to count without hashing, causing slow lookups
Fix: Use a hash map to get O(1) average lookup and update

Summary

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

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

The key is to store counts in a map and update counts as you see items.

Practice

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

easy

A. To remove duplicate items from the collection

B. To sort the items in ascending order

C. To count how many times each item appears in a collection

D. To reverse the order of items in the collection

Solution

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

   A hash map stores key-value pairs, allowing quick lookup of counts for each item.

2. Step 2: Connect to frequency counting

   Using the hash map, we track how many times each item appears by updating counts.

3. Final Answer:

   To count how many times each item appears in a collection -> Option C

4. Quick Check:

   Frequency counting = Counting items [OK]

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

Common Mistakes:

• Thinking hash map sorts items
• Confusing frequency counting with removing duplicates
• Assuming hash map reverses order

2. Which of the following Rust code snippets correctly initializes an empty hash map for frequency counting?

easy

A. let mut freq = Vec::with_capacity(10);

B. let freq = Vec::new();

C. let freq = HashSet::new();

D. let mut freq = HashMap::new();

Solution

1. Step 1: Identify the correct data structure for frequency counting

   Frequency counting requires a hash map to store keys and counts.

2. Step 2: Check Rust syntax for hash map initialization

   In Rust, HashMap::new() creates an empty hash map; mut allows modification.

3. Final Answer:

   let mut freq = HashMap::new(); -> Option D

4. Quick Check:

   HashMap::new() initializes empty map [OK]

Hint: Use HashMap::new() with mut for frequency map [OK]

Common Mistakes:

• Using Vec or HashSet instead of HashMap
• Forgetting mut keyword to modify map
• Confusing capacity with initialization

3. What will be the output of the following Rust code?

use std::collections::HashMap;

fn main() {
    let items = vec!["apple", "banana", "apple", "orange", "banana", "apple"];
    let mut freq = HashMap::new();

    for item in items {
        let count = freq.entry(item).or_insert(0);
        *count += 1;
    }

    println!("{:?}", freq);
}

medium

A. {"apple": 1, "banana": 1, "orange": 1}

B. {"apple": 3, "banana": 2, "orange": 1}

C. {"apple": 2, "banana": 2, "orange": 2}

D. Compilation error due to missing mut

Solution

1. Step 1: Count occurrences of each fruit

   "apple" appears 3 times, "banana" 2 times, "orange" 1 time in the vector.

2. Step 2: Check how counts are updated in the hash map

   Each item increments its count correctly using entry and or_insert.

3. Final Answer:

   {"apple": 3, "banana": 2, "orange": 1} -> Option B

4. Quick Check:

   Count each fruit correctly = {"apple":3,"banana":2,"orange":1} [OK]

Hint: Count each item incrementally with entry().or_insert(0) [OK]

Common Mistakes:

• Assuming counts start at 1 instead of 0
• Forgetting to dereference count to increment
• Confusing output format or order

4. Identify the error in this Rust code snippet for frequency counting:

use std::collections::HashMap;

fn main() {
    let items = vec!["cat", "dog", "cat"];
    let mut freq = HashMap::new();

    for item in items {
        let count = freq.entry(item).or_insert(1);
        *count += 1;
    }

    println!("{:?}", freq);
}

medium

A. or_insert should start with 0, not 1

B. Missing mut keyword for freq

C. Cannot use entry on a vector

D. Dereferencing count is not needed

Solution

1. Step 1: Understand or_insert initial value

   or_insert(1) sets initial count to 1, but counting starts from zero.

2. Step 2: Effect of starting at 1 on counts

   Starting at 1 causes counts to be off by one; correct is or_insert(0).

3. Final Answer:

   or_insert should start with 0, not 1 -> Option A

4. Quick Check:

   Frequency count starts at zero [OK]

Hint: Start counts at 0 with or_insert(0) [OK]

Common Mistakes:

• Starting count at 1 inflates frequencies
• Forgetting mut on freq (not error here)
• Misunderstanding dereference necessity

5. Given a list of words, how would you use the Frequency Counter Pattern with a hash map in Rust to find all words that appear exactly twice? Choose the best approach.

hard

A. Count frequencies with a hash map, then collect keys with value 2 into a vector

B. Sort the list and pick every second word

C. Use a hash set to store words and print those that appear twice

D. Count frequencies but ignore words appearing more than once

Solution

1. Step 1: Use hash map to count all word frequencies

   Traverse the list, increment counts for each word in the hash map.

2. Step 2: Filter keys with frequency exactly two

   Iterate over the hash map entries and collect words with count == 2.

3. Final Answer:

   Count frequencies with a hash map, then collect keys with value 2 into a vector -> Option A

4. Quick Check:

   Frequency count + filter for 2 = correct approach [OK]

Hint: Count all, then filter keys with count 2 [OK]

Common Mistakes:

• Sorting does not guarantee frequency counts
• Hash set cannot count duplicates
• Ignoring words with frequency > 1 loses needed data