Leetcode problem 2503

This is leetcode problem 2053 In an array of strings, we're on a quest For those that stand alone, unique from the rest Distinct strings are our treasure, appearing just once We'll count them carefully, no need to be a dunce K-th distinct, that's what we seek In order they appear, no need to tweak If K's too big, an empty string we'll find But if it's just right, the answer we'll unwind We start by counting, each string we tally How many times they show, we'll keep a rally A hash map's our tool, to track every word Counting occurrences, leaving none unheard Now we loop through, checking one by one Is it unique? Our search has begun We count distincts, until we reach K If we find it, that's the string we'll play K-th distinct, that's what we seek In order they appear, no need to tweak If K's too big, an empty string we'll find But if it's just right, the answer we'll unwind If our count falls short, and K's out of reach An empty string's returned, that's what we'll teach But if we succeed, the K-th distinct we'll show That's our solution, now you're in the know