Character Frequency Counting in DSA Python - Execution Trace

Concept Flow - Character Frequency Counting

Start with empty frequency map

↓

Read next character from string

↓

Is character in map?

No→Add character with count 1

|Yes↓

Increment character count by 1

↓

More characters?

Yes→Read next character

No↓

Done: frequency map ready

We start with an empty map, read each character, add or update its count, and repeat until all characters are processed.

Execution Sample

DSA Python

text = "hello"
freq = {}
for ch in text:
    freq[ch] = freq.get(ch, 0) + 1
print(freq)

Counts how many times each character appears in the string "hello".

Execution Table

Step	Operation	Character	Frequency Map Before	Frequency Map After	Visual State
1	Start	-	{}	{}	{}
2	Read character	h	{}	{'h': 1}	{'h': 1}
3	Read character	e	{'h': 1}	{'h': 1, 'e': 1}	{'h': 1, 'e': 1}
4	Read character	l	{'h': 1, 'e': 1}	{'h': 1, 'e': 1, 'l': 1}	{'h': 1, 'e': 1, 'l': 1}
5	Read character	l	{'h': 1, 'e': 1, 'l': 1}	{'h': 1, 'e': 1, 'l': 2}	{'h': 1, 'e': 1, 'l': 2}
6	Read character	o	{'h': 1, 'e': 1, 'l': 2}	{'h': 1, 'e': 1, 'l': 2, 'o': 1}	{'h': 1, 'e': 1, 'l': 2, 'o': 1}
7	End	-	{'h': 1, 'e': 1, 'l': 2, 'o': 1}	{'h': 1, 'e': 1, 'l': 2, 'o': 1}	{'h': 1, 'e': 1, 'l': 2, 'o': 1}

💡 All characters processed, frequency map complete.

Variable Tracker

Variable	Start	After Step 2	After Step 3	After Step 4	After Step 5	After Step 6	Final
freq	{}	{'h': 1}	{'h': 1, 'e': 1}	{'h': 1, 'e': 1, 'l': 1}	{'h': 1, 'e': 1, 'l': 2}	{'h': 1, 'e': 1, 'l': 2, 'o': 1}	{'h': 1, 'e': 1, 'l': 2, 'o': 1}
ch	-	h	e	l	l	o	-

Key Moments - 3 Insights

Why do we check if the character is already in the frequency map?

Because if the character is new, we add it with count 1; if it exists, we increase its count. See steps 2 and 5 in execution_table where 'h' is added first and 'l' count is incremented.

What happens if the input string is empty?

The loop never runs, so the frequency map stays empty as shown in step 1 where freq is {}.

Why do we use freq.get(ch, 0) + 1 instead of just freq[ch] + 1?

Because freq.get(ch, 0) returns 0 if the character is not yet in the map, avoiding errors. This is shown in step 2 when 'h' is not in freq yet.

Visual Quiz - 3 Questions

Look at the execution_table, what is the frequency map after reading the second character?

A {'e': 1}

B {'h': 2}

C {'h': 1, 'e': 1}

D {}

💡 Hint

Check row 3 in execution_table under 'Frequency Map After'

At which step does the count of 'l' increase from 1 to 2?

A Step 5

B Step 4

C Step 3

D Step 6

💡 Hint

Look at steps 4 and 5 in execution_table for changes in 'l' count

If the input string was empty, what would the frequency map be at the end?

A None

B {}

C {'': 1}

D {' ': 0}

💡 Hint

Refer to key_moments about empty input and step 1 in execution_table

Concept Snapshot

Character Frequency Counting:
- Use a map/dictionary to store counts
- For each character: if new, add with 1; else increment count
- Use freq.get(char, 0) + 1 to handle new chars
- Result is a map of char to count
- Useful for text analysis and counting duplicates

Full Transcript

This concept counts how many times each character appears in a string. We start with an empty dictionary called freq. We read each character one by one. If the character is not in freq, we add it with count 1. If it is already there, we increase its count by 1. We repeat this until all characters are processed. For example, for the string 'hello', the counts become {'h':1, 'e':1, 'l':2, 'o':1}. This method handles empty strings by returning an empty dictionary. Using freq.get(char, 0) helps avoid errors when a character is new. The final frequency map shows the count of each character in the string.

Practice

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

easy

A. How many times each character appears

B. The length of the string

C. The first character in the string

D. The position of the last character

Solution

1. Step 1: Understand the purpose of frequency counting

   Frequency counting means counting how many times each character appears in a string.

2. Step 2: Compare options with the definition

   Only How many times each character appears matches the purpose of character frequency counting.

3. Final Answer:

   How many times each character appears -> Option A

4. Quick Check:

   Frequency counting = count characters [OK]

Hint: Frequency counting means counting characters [OK]

Common Mistakes:

• Confusing frequency with string length
• Thinking it finds character positions
• Mixing frequency with sorting

2. Which of the following Python code snippets correctly counts character frequency in string s?

easy

A. freq = 0; for ch in s: freq += 1

B. freq = []; for ch in s: freq.append(ch)

C. freq = {}; for ch in s: freq[ch] = freq.get(ch, 0) + 1

D. freq = {}; for ch in s: freq[ch] = 1

Solution

1. Step 1: Analyze each code snippet

   freq = {}; for ch in s: freq[ch] = freq.get(ch, 0) + 1 uses a dictionary and increments count for each character correctly. freq = []; for ch in s: freq.append(ch) just collects characters in a list. freq = 0; for ch in s: freq += 1 counts total characters, not frequency per character. freq = {}; for ch in s: freq[ch] = 1 sets frequency to 1 always, ignoring repeats.

2. Step 2: Confirm correct frequency counting logic

   Only freq = {}; for ch in s: freq[ch] = freq.get(ch, 0) + 1 correctly counts how many times each character appears.

3. Final Answer:

   freq = {}; for ch in s: freq[ch] = freq.get(ch, 0) + 1 -> Option C

4. Quick Check:

   Use dict with get() to count [OK]

Hint: Use dict with get() to count frequencies [OK]

Common Mistakes:

• Using list instead of dict for counting
• Overwriting counts instead of incrementing
• Counting total length instead of per character

3. What is the output of this code?

text = 'hello'
freq = {}
for ch in text:
    freq[ch] = freq.get(ch, 0) + 1
print(freq)

medium

A. {'h': 1, 'e': 1, 'l': 1, 'o': 1}

B. {'h': 1, 'e': 1, 'l': 2, 'o': 1}

C. {'h': 1, 'e': 1, 'l': 3, 'o': 1}

D. {'h': 1, 'e': 1, 'l': 2}

Solution

1. Step 1: Count characters in 'hello'

   Characters: h(1), e(1), l(2), o(1)

2. Step 2: Check code logic

   Code correctly counts each character's frequency using dict and get().

3. Final Answer:

   {'h': 1, 'e': 1, 'l': 2, 'o': 1} -> Option B

4. Quick Check:

   Count 'l' twice, others once [OK]

Hint: Count repeated letters carefully [OK]

Common Mistakes:

• Counting 'l' only once
• Missing last character
• Incorrect dictionary format

4. Find the error in this code that counts character frequency:

text = 'apple'
freq = {}
for ch in text:
    freq[ch] += 1
print(freq)

medium

A. freq[ch] is used before initialization

B. Loop variable name is wrong

C. print statement syntax error

D. String 'apple' is invalid

Solution

1. Step 1: Identify how freq[ch] is updated

   freq[ch] += 1 tries to add 1 to freq[ch] without initializing freq[ch] first.

2. Step 2: Understand dictionary key initialization

   Since freq is empty initially, freq[ch] does not exist and causes an error.

3. Final Answer:

   freq[ch] is used before initialization -> Option A

4. Quick Check:

   Initialize dict keys before incrementing [OK]

Hint: Initialize dict keys before incrementing [OK]

Common Mistakes:

• Assuming dict keys auto-initialize
• Ignoring error messages
• Changing loop variable unnecessarily

5. Given a string s = 'banana', which code snippet correctly returns a dictionary with only characters that appear more than once?

hard

A. freq = {ch: 1 for ch in s if s.count(ch) > 1}

B. freq = {ch: s.count(ch) for ch in s}

C. freq = {ch for ch in s if s.count(ch) > 1}

D. freq = {ch: s.count(ch) for ch in set(s) if s.count(ch) > 1}

Solution

1. Step 1: Understand the goal

   We want a dictionary with characters appearing more than once and their counts.

2. Step 2: Analyze each option

   freq = {ch: 1 for ch in s if s.count(ch) > 1} sets count to 1 always, ignoring actual counts. freq = {ch: s.count(ch) for ch in set(s) if s.count(ch) > 1} uses set(s) to avoid duplicates and filters counts > 1 correctly. freq = {ch for ch in s if s.count(ch) > 1} creates a set instead of dictionary with counts. freq = {ch: s.count(ch) for ch in s} includes all characters regardless of count.

3. Final Answer:

   freq = {ch: s.count(ch) for ch in set(s) if s.count(ch) > 1} -> Option D

4. Quick Check:

   Use set to avoid duplicates and filter counts [OK]

Hint: Use set(s) and filter counts > 1 [OK]

Common Mistakes:

• Not using set to avoid duplicate keys
• Assigning wrong counts
• Including characters with single occurrence