👌👌Solved🥇   only five lines solution 👍👍 very easy to understand the logic
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def kthLargestNumber(self, nums: List[str], k: int) -> str:\n        int_arr = []\n\n        for num in nums:\n            int_arr.append(int(num))\n        \n        int_arr.sort(reverse=True)\n\n        return str(int_arr[k-1])\n```
['Python3']