One Liner | Properly explained | Beats 100% | C++
Intuition\n Describe your first thoughts on how to solve this problem. \nSorting using lambda\n\n# Approach\n Describe your approach to solving the problem. \nF
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nSorting using lambda\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nFirst, we sort the given array using lambda function.\nThere can be two possible cases for string a and b:\n1. If both strings are equal in size then we check simply a < b\n2. If both strings are not equal in size then the smaller size string will be smaller in value\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n##### Considering size of given array to be n\n$$O(nlogn)$$\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(1)$$\n\n# Code\n```\nclass Solution {\npublic:\n    string kthLargestNumber(vector<string>& nums, int k) {\n        sort(nums.begin(),nums.end(),[](string &a, string &b){return a.size() == b.size() ? a < b : a.size() < b.size();});\n        return nums[nums.size()-k];\n    }\n};\n```
['String', 'Sorting', 'C++']