I read of a job interview question to write some code for the following:
Write an efficient function to find the first nonrepeated character in a st
def firstnonrecur(word): for c in word: if word.count(c) == 1: print(c) break firstnonrecur('google')
How about this?