# Kth Distinct String in an Array (LeetCode 2053) First string with count 1 at k-th occurrence of distincts. ## Approach ```python from collections import Counter def kthDistinct(arr, k): cnt = Counter(arr) for s in arr: if cnt[s] == 1: k -= 1 if k == 0: return s return "" ``` ## Complexity - Time / space depend on the scan above; keep the solution linear when possible. ## Interview tip Narrate the invariant before coding. I drill these patterns with [real-time interview help](https://www.linkjob.ai/) ahead of OA rounds. *Disclosure: I work on Linkjob AI, an interview copilot. The algorithm above stands on its own.*