easy to learn(cmpfun)
Intuition\n Describe your first thoughts on how to solve this problem. \nsorting \n\n# Approach\n Describe your approach to solving the problem. \nsort vector o
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nsorting \n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nsort vector of string with cmpfunc\n\n     static bool cmpfunc(string &a,string &b){ \n        if(a.size()==b.size()) return a<b;\n        return a.size()<b.size();\n\n    }\nkth element from end\n\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(NlogN)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n\n# Code\n```cpp []\nclass Solution {\npublic:\n\n    static bool cmpfunc(string &a,string &b){ \n        if(a.size()==b.size()) return a<b;\n        return a.size()<b.size();\n\n    }\n    string kthLargestNumber(vector<string>& nums, int k) {\n        sort(nums.begin(),nums.end(),cmpfunc);\n        return nums[nums.size()-k];\n\n        \n    }\n};\n```
['C++']