Hash maps and sets · routine

First unique character

• right answers
• arguments left as they should be
• fast enough at scale
• without count, Counter, collections

def first_unique(text):
    for i in range(len(text)):
        if text.count(text[i]) == 1:
            return i
    return -1
 
 
 

Run adds print(first_unique("leetcode")) after your code, to try it.

Stuck on the idea rather than the code? The Hash maps and sets lesson walks through it.