leetcode

leetcode/387.py

@@ -0,0 +1,15 @@
+class Solution:
+    def firstUniqChar(self, s: str) -> int:
+        d={}
+
+
+        for i in range(len(s)):
+            if s[i] in d:
+                d[s[i]]=-1
+            else:
+                d[s[i]]=i
+        
+        for i in d.values():
+            if i>-1:
+                return i
+        return -1