# [LeetCode]#2053. Kth Distinct String in an Array

**Environment: Python 3.8**

**Key technique: Counter, for, if**

A **distinct string** is a string that is present only **once** in an array.

Given an array of strings `arr`

, and an integer `k`

, return *the *`kth`

* **distinct string** present in *`arr`

. If there are **fewer** than `k`

distinct strings, return *an **empty string *`""`

.

Note that the strings are considered in the **order in which they appear** in the array.

**Example 1:**

**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.

**Example 2:**

**Input:** arr = ["aaa","aa","a"], k = 1

**Output:** "aaa"

**Explanation:**

All strings in arr are distinct, so the 1st string "aaa" is returned.

**Example 3:**

**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 "".

**Analysis:**

- Counter arr
- Find only distinct strings
- return the order is match k

**Solution:**

`from collections import Counter`

class Solution:

def kthDistinct(self, arr, k):

cnt=Counter(arr)

for key,v in cnt.items():

if v==1:

k-=1

if k==0:

return key

return ""

**Submissions:**