Leetcode Problem 2053. Kth Distinct String in an Array

2053. Kth Distinct String in an Array

Leetcode Solutions

Initialize an empty hash table frequency_map to store the frequency of each string.
Iterate over the array arr and update the frequency of each string in frequency_map.
Initialize a counter distinct_count to 0 to keep track of the number of distinct strings encountered.
Iterate over the array arr again and for each string: a. Check if the frequency of the string in frequency_map is 1. b. If it is, increment distinct_count. c. If distinct_count equals k, return the current string as it is the kth distinct string.
If the loop completes without returning, it means there are fewer than k distinct strings, so return an empty string.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen