My Java Solution using PriorityQueue NlogK
\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k) {\n        if (nums == null || nums.length == 0)\n            return "";\n        i
```\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k) {\n        if (nums == null || nums.length == 0)\n            return "";\n        int length = nums.length;\n        PriorityQueue<String> minHeap = new PriorityQueue<>((s1, s2) -> {\n            if (s1.length() == s2.length()) \n                return s1.compareTo(s2);\n            else\n                return Integer.compare(s1.length(), s2.length());\n        });\n        for (String num : nums) {\n            minHeap.offer(num);\n            if (minHeap.size() > k) {\n                minHeap.poll();\n            }\n        }\n        return minHeap.poll();\n    }\n}\n```
['Sorting', 'Heap (Priority Queue)', 'Java']