_2053. Kth Distinct String in an Array.md

2053. Kth Distinct String in an Array

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : August 05, 2024

Last updated : August 05, 2024

---

Related Topics : Array, Hash Table, String, Counting

Acceptance Rate : 81.99 %

---

Solutions

• e2053.py

Python

e2053.py

class Solution:
    def kthDistinct(self, arr: List[str], k: int) -> str:
        distinct = set()
        notdistinct = set()

        for s in arr :
            if s in notdistinct :
                continue
            if s in distinct :
                distinct.remove(s)
                notdistinct.add(s)
            else :
                distinct.add(s)

        
        if k > len(distinct) :
            return ""
        
        for x in arr :
            if x not in distinct :
                continue
            k -= 1

            if k <= 0 :
                return x
        
        return 'error'