Kth Distinct String in an Array

lcpy gen -n 2053   # by problem number
lcpy gen -s kth_distinct_string_in_an_array   # by problem name

Input: arr = ["d","b","c","b","c","a"], k = 2
Output: "a"
Explanation:
The only distinct strings in arr are "d" and "a".
"d" appears 1st, so it is the 1st distinct string.
"a" appears 2nd, so it is the 2nd distinct string.
Since k == 2, "a" is returned.

Input: arr = ["aaa","aa","a"], k = 1
Output: "aaa"
Explanation:
All strings in arr are distinct, so the 1st string "aaa" is returned.

Input: arr = ["a","b","a"], k = 3
Output: ""
Explanation:
The only distinct string is "b". Since there are fewer than 3 distinct strings, we return an empty string "".

from collections import Counter


class Solution:
    # Time: O(n)
    # Space: O(n)
    def kth_distinct(self, arr: list[str], k: int) -> str:
        counts = Counter(arr)
        for s in arr:
            if counts[s] == 1:
                k -= 1
                if k == 0:
                    return s
        return ""