솜씨좋은장씨

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. Solution from collections import Counter class Solution: def firstUniqChar(self, s: str) -> int: answer = -1 s = list(s) cnt_dict = Counter(s) i = 0 for word in s: if cnt_dict[word] == 1: answer = i break i = i + 1 re..