Leetcode 2053. Kth Distinct String in an Array

Return the k-th string in the array that appears exactly once (a "distinct" string) in the original order, or "" if fewer than k distinct strings exist. This requires counting frequencies and then scanning the array in order to pick the k-th element with count 1.