Given a string s, find the first character that never repeats anywhere else in the string, and return its index. If every character repeats, return -1. Checking each character against every other character works, but it's quadratic. The faster approach counts every character's frequency in one pass, then makes a second pass in order and returns the index of the first character whose frequency is exactly 1 — the first one that was never seen again.