Why First Non Repeating Character Using Hash in DSA Python?

The Big Idea

What if you could find the first unique item in a crowd instantly, without checking everyone one by one?

The Scenario

Imagine you have a long list of names, and you want to find the first name that appears only once. Doing this by checking each name one by one can take a lot of time, especially if the list is very long.

The Problem

Manually checking each name against all others means repeating the same work many times. This is slow and easy to make mistakes, especially if the list is large or has many repeated names.

The Solution

Using a hash (like a dictionary) lets us count how many times each name appears quickly. Then, we can find the first name with a count of one without checking everything again and again.

Before vs After

✗ Before

for i in range(len(names)):
    count = 0
    for j in range(len(names)):
        if names[i] == names[j]:
            count += 1
    if count == 1:
        print(names[i])
        break

✓ After

counts = {}
for name in names:
    counts[name] = counts.get(name, 0) + 1
for name in names:
    if counts[name] == 1:
        print(name)
        break

What It Enables

This method makes it easy and fast to find unique items in large lists, opening doors to efficient text processing and data analysis.

Real Life Example

Finding the first unique visitor's name in a website log to personalize their experience without scanning the entire log repeatedly.

Key Takeaways

Manual checking is slow and error-prone for large data.

Hashing counts items quickly and helps find unique ones fast.

This approach is useful in text and data processing tasks.

Practice

1. What does the "First Non Repeating Character Using Hash" algorithm primarily do?

easy

A. Finds the first character in a string that appears only once

B. Counts the total number of characters in a string

C. Sorts characters of a string alphabetically

D. Reverses the string

Solution

1. Step 1: Understand the problem goal

   The algorithm aims to find the first character in the string that does not repeat anywhere else.

2. Step 2: Identify the main operation

   It uses a hash (dictionary) to count occurrences and then finds the first character with count 1.

3. Final Answer:

   Finds the first character in a string that appears only once -> Option A

4. Quick Check:

   First unique character = first non repeating character [OK]

Hint: Look for the first character with count one in the hash [OK]

Common Mistakes:

• Thinking it counts total characters instead of unique
• Confusing sorting with finding unique characters
• Assuming it reverses the string

2. Which of the following Python code snippets correctly initializes a hash (dictionary) to count characters in a string s?

easy

A. counts = []; for ch in s: counts[ch] += 1

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

C. counts = set(); for ch in s: counts.add(ch)

D. counts = 0; for ch in s: counts += 1

Solution

1. Step 1: Check dictionary initialization and update

   counts = {}; for ch in s: counts[ch] = counts.get(ch, 0) + 1 correctly creates an empty dictionary and updates counts using get with default 0.

2. Step 2: Analyze other options

   counts = []; for ch in s: counts[ch] += 1 uses a list which cannot be indexed by characters; counts = set(); for ch in s: counts.add(ch) uses a set which only stores unique items without counts; counts = 0; for ch in s: counts += 1 uses an integer which cannot store counts per character.

3. Final Answer:

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

4. Quick Check:

   Dictionary with get method counts chars correctly [OK]

Hint: Use dict.get(key, 0) to count characters safely [OK]

Common Mistakes:

• Using list instead of dictionary for counts
• Using set which does not count duplicates
• Trying to increment integer without keys

3. What is the output of the following code?

def first_non_repeating(s):
    counts = {}
    for ch in s:
        counts[ch] = counts.get(ch, 0) + 1
    for ch in s:
        if counts[ch] == 1:
            return ch
    return '_'

print(first_non_repeating('swiss'))

medium

A. s

B. _

C. i

D. w

Solution

1. Step 1: Count character occurrences in 'swiss'

   Counts: s=3, w=1, i=1

2. Step 2: Find first character with count 1 in order

   Order: s (3), w (1) -> first non repeating is 'w'

3. Final Answer:

   w -> Option D

4. Quick Check:

   First unique char in 'swiss' is 'w' [OK]

Hint: Check counts then scan string for first count 1 char [OK]

Common Mistakes:

• Returning first unique char incorrectly as 's'
• Confusing 'i' as first unique instead of 'w'
• Returning '_' when unique char exists

4. The following code is intended to find the first non repeating character but has a bug. What is the bug?

def first_non_repeating_bug(s):
    counts = {}
    for ch in s:
        counts[ch] += 1
    for ch in s:
        if counts[ch] == 1:
            return ch
    return '_'

medium

A. The for loop should iterate over counts.keys() instead of s

B. The return '_' statement is unreachable

C. counts dictionary is not initialized with default values before increment

D. The function does not return anything

Solution

1. Step 1: Analyze counts dictionary usage

   The code tries to increment counts[ch] without initializing counts[ch], causing KeyError.

2. Step 2: Identify missing initialization

   Must initialize counts[ch] to 0 before increment or use counts.get(ch, 0) + 1.

3. Final Answer:

   counts dictionary is not initialized with default values before increment -> Option C

4. Quick Check:

   Missing initialization causes KeyError [OK]

Hint: Initialize counts[ch] before increment or use get() [OK]

Common Mistakes:

• Assuming return '_' is unreachable
• Thinking loop over s is wrong
• Believing function returns nothing

5. Given the string s = 'aabbccddeeffg', which character will the first non repeating character algorithm return?
Note: The algorithm uses a hash to count characters and returns the first character with count 1 or '_' if none.

medium

A. g

B. a

C. _

D. f

Solution

1. Step 1: Count occurrences of each character in 'aabbccddeeffg'

   a=2, b=2, c=2, d=2, e=2, f=2, g=1

2. Step 2: Find first character with count 1 in string order

   All characters except 'g' repeat twice; 'g' appears once at the end.

3. Final Answer:

   g -> Option A

4. Quick Check:

   Only 'g' is unique in the string [OK]

Hint: Check counts; last unique char is first non repeating here [OK]

Common Mistakes:

• Choosing 'a' or 'f' which repeat twice
• Choosing '_' when unique char exists
• Ignoring order of characters