Java solution using PriorityQueue and BigInteger
\nimport java.math.BigInteger;\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k) {\n        PriorityQueue<BigInteger> pq = new Priorit
```\nimport java.math.BigInteger;\nclass Solution {\n    public String kthLargestNumber(String[] nums, int k) {\n        PriorityQueue<BigInteger> pq = new PriorityQueue<>();\n        for(int i=0;i<nums.length;i++){\n            pq.add(convertToInt(nums[i]));\n            if(pq.size() > k){pq.remove();}\n        }\n        return pq.peek().toString();\n    }\n    \n    public BigInteger convertToInt(String s){\n        return new BigInteger(s);\n    }\n}\n```
['Heap (Priority Queue)']