Two Liner solution | JS
\nvar kthLargestNumber = function(nums, k) {\n     nums.sort((a,b)=> BigInt(a)<BigInt(b) ? 1 :  BigInt(a)>BigInt(b) ? -1 : 0 );\n    return nums[k-1]\n};\n
```\nvar kthLargestNumber = function(nums, k) {\n     nums.sort((a,b)=> BigInt(a)<BigInt(b) ? 1 :  BigInt(a)>BigInt(b) ? -1 : 0 );\n    return nums[k-1]\n};\n```
['Sorting', 'JavaScript']