First non-repeating character
Given a string, return the index of the first character that does not repeat anywhere in the string. Return -1 if every character repeats.
Implement
first_uniq_char(s: str) → intExamples
in
["notebook"]out0What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 15 min
solution.py
InputExpectedGot
["notebook"]0not run yetsample