304 North Cardinal St.
Dorchester Center, MA 02124

# Kth Largest Element in a Stream LeetCode Solution

## Problem – Kth Largest Element in a Stream

Design a class to find the `kth` largest element in a stream. Note that it is the `kth` largest element in the sorted order, not the `kth` distinct element.

Implement `KthLargest` class:

• `KthLargest(int k, int[] nums)` Initializes the object with the integer `k` and the stream of integers `nums`.
• `int add(int val)` Appends the integer `val` to the stream and returns the element representing the `kth` largest element in the stream.

Example 1:

``````Input
[[3, [4, 5, 8, 2]], [3], [5], [10], [9], [4]]
Output
[null, 4, 5, 5, 8, 8]

Explanation
KthLargest kthLargest = new KthLargest(3, [4, 5, 8, 2]);
``````

Constraints:

• `1 <= k <= 104`
• `0 <= nums.length <= 104`
• `-104 <= nums[i] <= 104`
• `-104 <= val <= 104`
• At most `104` calls will be made to `add`.
• It is guaranteed that there will be at least `k` elements in the array when you search for the `kth` element.

### Kth Largest Element in a Stream LeetCode Solution in Java

``````   class KthLargest {
final PriorityQueue<Integer> q;
final int k;

public KthLargest(int k, int[] a) {
this.k = k;
q = new PriorityQueue<>(k);
for (int n : a)
}

if (q.size() < k)
q.offer(n);
else if (q.peek() < n) {
q.poll();
q.offer(n);
}
return q.peek();
}
}
``````

### Kth Largest Element in a Stream LeetCode Solution in Python

``````class KthLargest(object):

def __init__(self, k, nums):
self.pool = nums
self.k = k
heapq.heapify(self.pool)
while len(self.pool) > k:
heapq.heappop(self.pool)

if len(self.pool) < self.k:
heapq.heappush(self.pool, val)
elif val > self.pool[0]:
heapq.heapreplace(self.pool, val)
return self.pool[0]
``````

### Kth Largest Element in a Stream LeetCode Solution in C++

``````    priority_queue<int, vector<int>, greater<int>> pq;
int size;
KthLargest(int k, vector<int> nums) {
size=k;
for(int i=0;i<nums.size();i++) {
pq.push(nums[i]);
if(pq.size()>k) pq.pop();
}
}

pq.push(val);
if(pq.size()>size) pq.pop();
return pq.top();
}
``````
##### Kth Largest Element in a Stream LeetCode Solution Review:

In our experience, we suggest you solve this Kth Largest Element in a Stream LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Kth Largest Element in a Stream LeetCode Solution

Find on LeetCode

##### Conclusion:

I hope this Kth Largest Element in a Stream LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions