// First Unique Character in a String — EASY

// Category: hash-map

Given a string `s`, find the **first** non-repeating character and return its index. If it does not exist, return `-1`.

Hint: Count character frequencies with a hash map, then scan left to right for the first char with count 1.

Example: s = "leetcode"

Output: 0