Why First Non Repeating Character Using Hash in DSA C?

The Big Idea

Discover how a simple counting trick can save you from endless searching!

The Scenario

Imagine you have a long list of letters from a story, 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.

The Problem

Checking each letter manually means going through the list many times, which is slow and tiring. It's easy to make mistakes and miss the right letter, especially if the list is very long.

The Solution

Using a hash (a simple counting tool) helps us count how many times each letter appears quickly. Then, we can find the first letter that only appears once without checking the whole list repeatedly.

Before vs After

✗ Before

for (int i = 0; i < length; i++) {
  int count = 0;
  for (int j = 0; j < length; j++) {
    if (str[i] == str[j]) count++;
  }
  if (count == 1) return str[i];
}

✓ After

int count[256] = {0};
for (int i = 0; i < length; i++) {
  count[(unsigned char)str[i]]++;
}
for (int i = 0; i < length; i++) {
  if (count[(unsigned char)str[i]] == 1) return str[i];
}
return '\0';

What It Enables

This method lets us quickly find the first unique letter in any text, even if it's very long, without wasting time.

Real Life Example

When typing a message, your phone can use this to suggest the first unique letter you typed that might be a special shortcut or important character.

Key Takeaways

Manual checking is slow and error-prone for long texts.

Hash counting stores letter counts efficiently.

Finding the first unique letter becomes fast and simple.