Leetcode 387. First Unique Character in a String(Python)

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 <= 105
• s consists of only lowercase English letters.

class Solution(object):
    def firstUniqChar(self, s):
        """
        :type s: str
        :rtype: int
        """
        index = []
        st = 'abcdefghijklmnopqrstvwxyz'
        for i in st:
            if s.count(i) == 1:
                index.append(s.index(i))
                
        if len(index) == 0:
            return -1
        else:
            return min(index)