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.