A distinct string is a string that occurs exactly once in an array.

Given an array of strings arr and an integer k, return the $k^{ ext{th}}$ distinct string that appears in arr. If arr contains fewer than k distinct strings, return an empty string "".

Note that strings are evaluated in the order of their appearance in arr.

Constraints:

• $1 \leq$ k $\leq$ arr.length $\leq 1000$

• $1 \leq$ arr[i].length $\leq 5$

• arr[i] consists of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.