Search⌘ K
AI Features

Solution: First Unique Character in a String

Understand how to identify the first unique character in a string by tracking character occurrences with a hash map. This lesson guides you through an efficient method using a frequency map to solve the problem with linear time and constant space complexity.

Statement

For a given string of characters, s, your task is to find the first non-repeating character and return its index. Return 1-1 if there’s no unique character in the given string.

Constraints:

  • 11 \leq s.length ...