Beats 99.5% || Python || 1 Liner || Sorting || easy
\nclass Solution:\n    def kthLargestNumber(self, nums: List[str], k: int) -> str:\n        return str(sorted(list(map(int,nums)),reverse=True)[k-1])\n\n\t\t\nA
```\nclass Solution:\n    def kthLargestNumber(self, nums: List[str], k: int) -> str:\n        return str(sorted(list(map(int,nums)),reverse=True)[k-1])\n```\n\t\t\n**An Upvote will be encouraging\t**\t
['Sorting', 'Python3']