Home > Article > Backend Development > Kth Distinct String in an Array
2053. Kth Distinct String in an Array
Easy
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:
Example 2:
Example 3:
Constraints:
Hint:
Solution:
To solve this problem, we can follow these steps:
Let's implement this solution in PHP: 2053. Kth Distinct String in an Array
Explanation:
- Frequency Map: We first create a frequency map to count how many times each string appears in the array.
- ["d", "b", "c", "b", "c", "a"] results in ["d" => 1, "b" => 2, "c" => 2, "a" => 1]
- Collect Distinct Strings: We iterate through the array again, collecting strings that have a count of 1 in the frequency map.
- For ["d", "b", "c", "b", "c", "a"], we get ["d", "a"].
- Return Result: We check if there are at least k distinct strings and return the k-th one if it exists, otherwise return an empty string.
The provided code handles the problem efficiently within the given constraints.
Contact Links
If you found this series helpful, please consider giving the repository a star on GitHub or sharing the post on your favorite social networks ?. Your support would mean a lot to me!
If you want more helpful content like this, feel free to follow me:
The above is the detailed content of Kth Distinct String in an Array. For more information, please follow other related articles on the PHP Chinese website!