Kth largest is simple 1. Create a priority queue(min-heap) 2. Insert 0-K elements from array in the heap 3. Insert the remaining elements also, but before every offer(), do a poll(). 4. Peek() the queue. That's your kth largest.