Java | 114ms | Comparator
class Solution {\n    \n    class StringComp implements Comparator\n    {\n     \n        \n        \n        public int compare(String s1, String s2)\n        
class Solution {\n    \n    class StringComp implements Comparator<String>\n    {\n     \n        \n        \n        public int compare(String s1, String s2)\n        {\n            if(s1.length() > s2.length()) return -1; \n            \n            else if(s1.length() == s2.length())\n            \n                return compareTwoNum( s1,  s2);\n\t\t\t\t\n            else if(s1.length() < s2.length()) return 1;\n            \n            return 0;\n            \n            \n        }\n        \n        \n        public int compareTwoNum(String s1, String s2)\n        {\n            if(s1.length() == 0 || s2.length() == 0) return 0;\n            \n            if(s1.charAt(0) > s2.charAt(0))\n                return -1;\n            else if(s1.charAt(0) < s2.charAt(0))\n                return 1;\n            \n            return compareTwoNum(s1.substring(1) , s2.substring(1));\n        }\n        \n    }\n    \n    \n    public String kthLargestNumber(String[] nums, int k) {\n     \n        StringComp sc = new StringComp();\n        \n        Arrays.sort(nums, sc);\n        // System.out.println(Arrays.toString(nums));\n        return nums[k-1];\n        \n        \n    }\n}\n\n\nEasy to understand, let me know in comments if you have any doubts
['Java']