C++ QuickSelect if anybody need :)
\nclass Solution {\npublic:\n    int partition(vector<string> &nums, int l, int r)\n    {\n        string pivot=nums[r];\n        int i=l-1;\n        for(int j=
```\nclass Solution {\npublic:\n    int partition(vector<string> &nums, int l, int r)\n    {\n        string pivot=nums[r];\n        int i=l-1;\n        for(int j=l;j<r;j++)\n        {\n            if(nums[j].size()<pivot.size() || (nums[j].size()==pivot.size() &&nums[j]<pivot))\n            {\n                i++;\n                swap(nums[i], nums[j]);\n            }\n        }\n        swap(nums[i+1], nums[r]);\n        return i+1;\n    }\n\n    string kthLargestNumber(vector<string>& nums, int k) {\n        int l=0,r=nums.size()-1;\n        k=nums.size()-k;\n        while(l<=r)\n        {\n            int p = partition(nums, l, r);\n            if(p==k)\n                return nums[p];\n            else if(p<k)\n                l=p+1;\n            else\n                r=p-1;\n        }\n        return "";\n    }\n};\n```\n\nIt is giving TLE but I put it in case someone need this solution. \n\n```\nclass Solution {\npublic:\n    static bool cmp(string &a,string &b)\n    {\n        if(a.size()==b.size())\n        {\n            return a<b;\n        }\n        return a.size()<b.size();\n    }\n    string kthLargestNumber(vector<string>& nums, int k) \n    {\n        sort(nums.begin(),nums.end(),cmp);\n        int n=nums.size();\n        return nums[n-k];\n    }\n};\n```\nTo handle TLE, sort function use quicksort, Insertion sort and heap sort. \n\n
['C', 'Sorting']