[C++] Solution With Short Comments
\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n        // This lenToNum vector puts two strings into same bucket if th
```\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n        // This lenToNum vector puts two strings into same bucket if they have same length.\n\t\t// Its size is 101 because max length of the num is 100.\n        vector<vector<string>> lenToNum(101);\n        int sz, i;\n        for(string n: nums) lenToNum[n.size()].push_back(n);\n        // Larger the length greater the element hence start from the back to find kth largest element.\n        for(i=100;i>=0;i--) {\n            sz = lenToNum[i].size();\n            if(sz >= k) break;\n            k -= sz;\n        }\n        // We reached the bucket where kth largest element is present. \n        vector<string> bucket = lenToNum[i];\n        // Sort the bucket in decreasing order.\n        sort(bucket.begin(), bucket.end(), greater<string>());\n        return bucket[k-1];\n    }\n};\n```
['Sorting', 'C++']