class Solution:
def kthDistinct(self, arr: List[str], k: int) -> str:
for i in range(len(arr)):
flag = True
for j in range(len(arr)):
if i == j:
continue
if arr[i] == arr[j]:
flag = False
break
if flag:
k -= 1
if k == 0:
return arr[i]
return ""class Solution:
def kthDistinct(self, arr: List[str], k: int) -> str:
count = {}
for s in arr:
if s not in count:
count[s] = 0
count[s] += 1
for s in arr:
if count[s] == 1:
k -= 1
if k == 0:
return s
return ""class Solution:
def kthDistinct(self, arr: List[str], k: int) -> str:
distinct, seen = set(), set()
for s in arr:
if s in distinct:
distinct.remove(s)
seen.add(s)
elif s not in seen:
distinct.add(s)
for s in arr:
if s in distinct:
k -= 1
if k == 0:
return s
return ""