Java Priority Queue
\npublic String kthLargestNumber(String[] nums, int k) {\n\tPriorityQueue<String> queue = new PriorityQueue<>((x, y) ->x.length() != y.length()?x.length()-y.len
```\npublic String kthLargestNumber(String[] nums, int k) {\n\tPriorityQueue<String> queue = new PriorityQueue<>((x, y) ->x.length() != y.length()?x.length()-y.length(): x.compareTo(y));\n\tfor(String s:nums) {\n\t\tqueue.offer(s);\n\t\tif(queue.size()>k)\n\t\t\tqueue.poll();\n\t}\n\treturn queue.poll();\n}\n```
[]