JAVA | HEAP | EASY | NOOB_CODER
\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k) {\n        PriorityQueue<String> pq=new PriorityQueue<>((a,b)->{\n          if(a.le
```\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k) {\n        PriorityQueue<String> pq=new PriorityQueue<>((a,b)->{\n          if(a.length()==b.length())return b.compareTo(a);\n          else if(a.length()<b.length())return 1;\n          else return -1;\n        });\n        for(String i:nums)pq.add(i);\n        while(k--!=1)pq.poll();\n        return pq.peek();\n    }\n}\n```
['Heap (Priority Queue)', 'Java']