Easy C++ and Python solutions
C++ Solution:\nIn the given constraints, it is not possible to store such large numbers.\nThis question can be easily solved by first sorting the numbers and fi
C++ Solution:\nIn the given constraints, it is not possible to store such large numbers.\nThis question can be easily solved by first sorting the numbers and find the Kth largest integer\n```\n//compare function to sort strings in accending order\nbool compare(string &s1,string &s2) {\n    // if the length of both the numbers is not equal then we can easily find the larger number\n    if(s1.length()!=s2.length()) {\n        //if the length of string s1 is smaller then it is smaller then s2\n        //otherwise string s2 is smaller\n        return s1.length()<s2.length();\n    }\n    //now we know that the length of both the strings is equal\n    int l = s1.length(); // l is the length of the strings\n    for(int i=0;i<l;i++) {\n        //if character is not equal at any position,we can easily compare numbers\n        if(s1[i]!=s2[i]) {\n            return s1[i]<s2[i];\n        }\n    }\n    //we reach here if both the strings are equal, so we can return false\n    return false;\n}\n\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n        // sort numbers in accending order\n        sort(nums.begin(),nums.end(),compare);\n        int n = nums.size();\n        //the kth largest number will be present at n-k index\n        return nums[n-k];\n    }\n};\n```\n\nPython Solution:\nSince we can store large integers in python, we can first convert the string into integers and sort them. After sorting, the Kth largest integer will be present at "-k" index\n\n```\nclass Solution:\n    def kthLargestNumber(self, nums: List[str], k: int) -> str:\n        l = [int(x) for x in nums]\n        l.sort()\n        return str(l[-k])\n```
[]