LeetCode 703Kth Largest Element in a Stream

LeetCode 703 Kth Largest Element in a Stream Problem

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

def __init__(self, k, nums):
self.nums = nums
self.k = k
# build min heap
heapq.heapify(self.nums)
# remove n - k smallest number
while len(self.nums) > k:
heapq.heappop(self.nums)

def add(self, val):
# add to heaq if it's less then k
if len(self.nums) < self.k:
heapq.heappush(self.nums, val)
elif val > self.nums[0]:
# if len(heaq) == k, and val greater than smallest num
# then pop smallest num than add val to heap
heapq.heapreplace(self.nums, val)
# return k largest
return self.nums[0]

# Your KthLargest object will be instantiated and called as such:
# obj = KthLargest(k, nums)
# param_1 = obj.add(val)
``````
Download Kth Largest Element in a Stream.py

List of all Kth Largest Element in a Stream problems

Leetcode 703 Kth Largest Element in a Stream problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.

Feedback is the most important part of any website.

If you have any query, suggestion or feedback, Please feel free to contact us.