2 Solutions || Quick Select || Heap || Comparator
Heap\n\n\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n         auto comp = [](string  &a, string &b) {\n            i
# Heap\n\n```\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n         auto comp = [](string  &a, string &b) {\n            if(a.size() == b.size()) {\n                return a > b;\n            }\n            return a.size() > b.size();\n        };\n\n        priority_queue< string, vector<string>, decltype(comp) >pq(comp);\n        for(auto &it : nums) {\n            pq.push(it);\n            if(pq.size() > k)pq.pop();\n        }\n        return pq.top();\n    }\n};\n```\n# Quick Select\n```\nclass Solution {\npublic:\n\n    string kthLargestNumber(vector<string>& nums, int k) {\n        nth_element(begin(nums), begin(nums) + k - 1, end(nums), [](string  &a, string &b) {\n            if(a.size() == b.size()) {\n                return a > b;\n            }\n            return a.size() > b.size();\n        });\n        return nums[k-1];\n    }\n};\n```
['Heap (Priority Queue)', 'Quickselect', 'C++']