Why First Non Repeating Character Using Hash in DSA Java?

The Big Idea

What if you could find the first unique letter in a huge text instantly without checking every letter again and again?

The Scenario

Imagine you have a long list of letters from a book, and you want to find the first letter that appears only once. Doing this by checking each letter one by one in the whole list can take a lot of time and effort.

The Problem

Manually checking each letter against all others means repeating the same work many times. This is slow and easy to make mistakes, especially if the list is very long.

The Solution

Using a hash (like a map) helps by counting how many times each letter appears quickly. Then, you just look once more to find the first letter with count one. This saves time and avoids repeated checks.

Before vs After

✗ Before

for (int i = 0; i < str.length(); i++) {
  boolean unique = true;
  for (int j = 0; j < str.length(); j++) {
    if (i != j && str.charAt(i) == str.charAt(j)) {
      unique = false;
      break;
    }
  }
  if (unique) return str.charAt(i);
}

✓ After

Map<Character, Integer> counts = new HashMap<>();
for (char ch : str.toCharArray()) {
  counts.put(ch, counts.getOrDefault(ch, 0) + 1);
}
for (char ch : str.toCharArray()) {
  if (counts.get(ch) == 1) return ch;
}
return '\0';

What It Enables

This method makes it easy and fast to find unique letters even in very long texts.

Real Life Example

Finding the first unique character helps in text analysis, like spotting the first unique word starter in a sentence or detecting errors in typing.

Key Takeaways

Manual checks repeat work and are slow.

Hash maps count characters quickly.

Two passes: count then find first unique.

Practice

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

easy

A. Reverses the string using a hash map

B. Counts the total number of characters in a string

C. Sorts characters of a string in alphabetical order

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

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: Role of hash map

   A hash map stores character counts to quickly check which characters appear once.

3. Final Answer:

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

4. Quick Check:

   First non repeating character = Finds the first character in a string that appears only once [OK]

Hint: Look for the first unique character using counts [OK]

Common Mistakes:

• Thinking it counts total characters only
• Confusing sorting with finding unique character
• Assuming it reverses the string

2. Which Java collection is best suited to store character counts for this problem?

easy

A. ArrayList<Character>

B. HashMap

C. LinkedList<Character>

D. TreeSet<Character>

Solution

1. Step 1: Identify data structure needs

   We need to map each character to its count, so a key-value structure is required.

2. Step 2: Choose appropriate Java collection

   HashMap stores characters as keys and their counts as values efficiently.

3. Final Answer:

   HashMap -> Option B

4. Quick Check:

   Use HashMap for character counts [OK]

Hint: Use HashMap for key-value pairs of char and count [OK]

Common Mistakes:

• Using list which doesn't map keys to counts
• Using TreeSet which stores unique sorted elements only
• Using LinkedList which is not key-value based

3. What is the output of the following Java code snippet?

String s = "swiss";
HashMap map = new HashMap<>();
for(char c : s.toCharArray()) {
  map.put(c, map.getOrDefault(c, 0) + 1);
}
for(char c : s.toCharArray()) {
  if(map.get(c) == 1) {
    System.out.println(c);
    break;
  }
}

medium

A. w

B. s

C. i

D. No output

Solution

1. Step 1: Count character frequencies

   Characters and counts: s=3, w=1, i=1.

2. Step 2: Find first character with count 1

   Iterate string: 's'(3), 'w'(1) -> first non repeating is 'w'.

3. Final Answer:

   w -> Option A

4. Quick Check:

   First unique char in "swiss" = w [OK]

Hint: Check counts then first unique char in order [OK]

Common Mistakes:

• Choosing 's' which repeats
• Choosing 'i' which is unique but appears after 'w'
• Assuming no output if not careful

4. Identify the error in this code snippet for finding the first non repeating character:

String s = "hello";
HashMap map = new HashMap<>();
for(int i = 0; i < s.length(); i++) {
  map.put(s.charAt(i), 1);
}
for(int i = 0; i < s.length(); i++) {
  if(map.get(s.charAt(i)) == 1) {
    System.out.println(s.charAt(i));
    break;
  }
}

medium

A. The map.put always sets count to 1, ignoring repeats

B. The loop should start from 1, not 0

C. The map should use Character keys, not int

D. The break statement is missing

Solution

1. Step 1: Analyze map population logic

   The code sets count to 1 for every character without incrementing, so repeats are not counted.

2. Step 2: Effect on finding non repeating character

   Since all counts are 1, the code incorrectly treats all characters as unique.

3. Final Answer:

   The map.put always sets count to 1, ignoring repeats -> Option A

4. Quick Check:

   Count update missing causes wrong results [OK]

Hint: Increment count instead of setting 1 every time [OK]

Common Mistakes:

• Not incrementing counts in map
• Wrong loop indices
• Confusing key types in map

5. Given the string "aabbccddeeffg", which character will be the first non repeating character using the hash method? What if the string is "aabbccddeeffggh"?

hard

A. First: g, Second: g

B. First: a, Second: h

C. First: g, Second: h

D. First: h, Second: h

Solution

1. Step 1: Analyze first string "aabbccddeeffg"

   All characters except 'g' appear twice; 'g' appears once, so first non repeating is 'g'.

2. Step 2: Analyze second string "aabbccddeeffggh"

   Now 'g' appears twice, 'h' appears once, so first non repeating is 'h'.

3. Final Answer:

   First: g, Second: h -> Option C

4. Quick Check:

   Check counts carefully for each string [OK]

Hint: Check counts carefully; last unique changes with input [OK]

Common Mistakes:

• Assuming first character is always unique
• Ignoring updated counts in second string
• Confusing repeated characters as unique