Easy and Beginner approach || Python 3 || Self-Explanatory Code
Intuition\n\n\n# Approach\n\n1. Convert Strings to Integers:\n\nThe input nums is a list of strings representing numbers.\nConvert each string in the list nums 
# Intuition\n\n\n# Approach\n\n1. Convert Strings to Integers:\n\nThe input nums is a list of strings representing numbers.\nConvert each string in the list nums to an integer and store these integers in a new list called newList.\n2. Sort the List:\n\nSort newList in ascending order. This sorting operation will arrange the numbers from the smallest to the largest.\n\n3. Find the k-th Largest Number:\n\nIterate backward through newList starting from the end (which contains the largest number after sorting).\nDecrement k on each iteration to count down until k becomes zero.\nWhen k reaches zero, the current element is the k-th largest number. Convert this number back to a string and return it.\n\n# Complexity\n- Time complexity:\nO(nlogn)\n\n- Space complexity:\nO(n)\n\n# Code\n```\nclass Solution:\n    def kthLargestNumber(self, nums: List[str], k: int) -> str:\n        newList=[int(i) for i in nums]\n        newList.sort()\n        for i in range(len(newList),-1,-1):\n            if k==0:\n                return str(newList[i])\n            k-=1\n```\n![image.png](https://assets.leetcode.com/users/images/952e453d-96d0-416b-b2e5-8666a54ea164_1718877282.9258978.png)\n
['Python3']