Write a Python program to create a dictionary from a string. Note: Track the count of the letters from the str

Programming Problems · Q4

Q. Write a Python program to create a dictionary from a string. Note: Track the count of the letters from the string. Sample string : 'w3resource' Expected output : {'3': 1, 's': 1, 'r': 2, 'u': 1, 'w': 1, 'c': 1, 'e': 2, 'o': 1}

Sikkim CbseNCERTSubjective· 3mImportance★★★★★est

80% · 24/30 Questions

🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Concept understanding — Element Frequency Count

Element Frequency Count — The Intuition

Imagine you have a bag of marbles. Some are red, some blue, some green. If someone asks "how many blue marbles are there?", you'd count them. That's exactly what element frequency count is — counting how many times each distinct item appears in a collection.

In programming terms, you have an array (or list) of elements, and you want to know: for each unique element, how many times does it occur?

Note

The "element" can be anything: a number, a character, a string, or even an object. The "frequency" is just the count of its occurrences.

The Precise Statement

Given a collection (array, list, string, etc.) of $n$ elements, the frequency count of an element $x$ is the number of times $x$ appears in that collection. Formally:

\text{freq}(x) = \sum_{i=1}^{n} \mathbf{1}(a_i = x)

where $\mathbf{1}(\text{condition})$ is 1 when the condition is true and 0 otherwise.

The element frequency count of the entire collection is a mapping (or dictionary) from each distinct element to its frequency.

Why It Matters

This is one of the most fundamental operations in data analysis and algorithm design. You use it to:

Find the most/least frequent element (mode)
Detect duplicates
Build histograms
Solve pattern-matching problems
Analyse text (word frequencies)

How to Compute It — The Standard Method

The simplest approach uses a hash map (dictionary):

Create an empty dictionary.
Loop through each element in the collection.
For each element:
- If it's already in the dictionary, increment its count by 1.
- Otherwise, add it to the dictionary with count 1.

In pseudocode:

freq = empty dictionary
for each element e in collection:
    if e in freq:
        freq[e] = freq[e] + 1
    else:
        freq[e] = 1
return freq

Tip

Many languages have a built-in shortcut. In Python, collections.Counter does exactly this in one line. In C++, std::unordered_map with ++freq[e] works because new keys are default-initialised to 0.

A Concrete Example

Take the array: [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]

Step through:

Element	Action	Dictionary state
3	new → count=1	{3:1}
1	new → count=1	{3:1, 1:1}
4	new → count=1	{3:1, 1:1, 4:1}
1	existing → increment	{3:1, 1:2, 4:1}
5	new → count=1	{3:1, 1:2, 4:1, 5:1}
9	new → count=1	{3:1, 1:2, 4:1, 5:1, 9:1}
2	new → count=1	{3:1, 1:2, 4:1, 5:1, 9:1, 2:1}
6	new → count=1	{3:1, 1:2, 4:1, 5:1, 9:1, 2:1, 6:1}
5	existing → increment	{3:1, 1:2, 4:1, 5:2, 9:1, 2:1, 6:1}
3	existing → increment	{3:2, 1:2, 4:1, 5:2, 9:1, 2:1, 6:1}
5	existing → increment	{3:2, 1:2, 4:1, 5:3, 9:1, 2:1, 6:1}

Final result: 3 appears twice, 1 appears twice, 4 once, 5 three times, 9 once, 2 once, 6 once.

Complexity …

Start your 14-day free trial to unlock the full solution →

Walk the string character by character, using each character as a dictionary key and its running count as the value. get(ch, 0) returns the current count or 0 for a first sighting:

st = 'w3resource'
d = {}
for ch in st:
    d[ch] = d.get(ch, 0) + 1
print(d)

Output (Python 3.7+ keeps insertion order):

{'w': 1, '3': 1, 'r': 2, 'e': 2, 's': 1, 'o': 1, 'u': 1, 'c': 1}
``` …

Start your 14-day free trial to unlock the full solution →

One pass over the string with d[ch] = d.get(ch, 0) + 1 builds the letter-frequency dictionary; the counts match the book exactly, and only the key order differs (modern Python preserves insertion order).

The idea. Frequency counting is the signature use of a dictionary: the thing being counted is the key, the count is the value. The neat trick is dict.get(ch, 0) — it returns the existing count if ch is already a key and 0 if it is not, so one line handles both the "first time seen" and "seen again" cases.

Program:

st = 'w3resource'
d = {}
for ch in st:
    d[ch] = d.get(ch, 0) + 1    # get() returns 0 if ch is not yet a key
print(d)

Verified output (Python 3.7+):

{'w': 1, '3': 1, 'r': 2, 'e': 2, 's': 1, 'o': 1, 'u': 1, 'c': 1}

Step-by-step trace of the interesting characters:

ch	action	dictionary after
w	new key, count 1	{'w': 1}
3	new key, count 1	{'w': 1, '3': 1}
r	new key, count 1	... 'r': 1
e	new key, count 1	... 'e': 1
s	new key, count 1	... 's': 1
o	new key, count 1	... 'o': 1
u	new key, count 1	... 'u': 1
r	existing key -> 1 + 1	... 'r': 2
c	new key, count 1	... 'c': 1
e	existing key -> 1 + 1	... 'e': 2

Start your 14-day free trial to unlock the full solution →

←Previous questionQ3 — Write a Python program to find the highest 2 values in a dictionary.→Next questionQ5 — Write a program to input your friends’ names and their Phone Numbers a…

Q.Write a Python program to create a dictionary from a string. Note: Track the count of the letters from the string. Sample string : 'w3resource' Expected output : {'3': 1, 's': 1, 'r': 2, 'u': 1, 'w': 1, 'c': 1, 'e': 2, 'o': 1}

🎓Unlock everything free for 14 days

Q.Write a Python program to create a dictionary from a string.
Note: Track the count of the letters from the string.
Sample string : 'w3resource'
Expected output : {'3': 1, 's': 1, 'r': 2, 'u': 1, 'w': 1, 'c': 1, 'e': 2, 'o': 1}

Unlock everything free for 14 days