Question
Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1.
Example 1:
Input: s = "leetcode" Output: 0
Example 2:
Input: s = "loveleetcode" Output: 2
Example 3:
Input: s = "aabb" Output: -1
Constraints:
1 <= s.length <= 105sconsists of only lowercase English letters.
Python Solution
class Solution:
def firstUniqChar(self, s: str) -> int:
d={}
for i in s:
if i not in d:
d[i]=1
else:
d[i]+=1
for k,v in d.items():
if v==1:
return s.index(k)
return -1

![[Solved] You are given an integer n and an integer start. Define an array nums where nums[i] = start + 2 * i (0-indexed) and n == nums.length. Return the bitwise XOR of all elements of nums.](https://machinelearningprojects.net/wp-content/uploads/2022/09/Leetcode-solutions-MLP-Feature-Image-1024x536.webp)