def firstUniqChar_v3(s: str) -> int:
    """Slowest approach. Worst case complexity is O(n^2). Not much better than v2."""
    for k, c in enumerate(s):
        if s.find(c) == s.rfind(c):
            return k
    return -1