Given an array of strings, nums, where each string represents an integer without leading zeros, and an integer k, your task is to find and return the string representing the k$^{th}$ largest integer in the array.

Note: Treat duplicate integers as distinct entities. For instance, if nums $= [\text{\lq\lq2\rq\rq, \lq\lq3\rq\rq, \lq\lq3\rq\rq]}$, the first largest integer is $\text{\lq\lq3\rq\rq}$, the second largest is also $\text{\lq\lq3\rq\rq}$, and the third largest is $\text{\lq\lq2\rq\rq}$.

Constraints:

• $1 <=$ k $<=$ nums.length $<= 10^3$

• $1 <=$ nums[i].length $<= 100$

• nums[i] consists of only digits.

• nums[i] will not have any leading zeros.

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 on how to solve this problem.

Implement your solution in the following coding playground.