Problem: Kth Largest Element in a Stream
Explore how to build a KthLargest class in Python that manages a stream of test scores to return the kth largest score efficiently. Learn to implement and maintain a min heap of size k, handling insertions and retrieving the kth largest element in real-time. Understand the time and space complexities involved in this continuous data tracking problem.
We'll cover the following...
Statement
You are part of a university admissions office that needs to dynamically track the kth highest test score among applicants in real time. This functionality is critical for determining cutoff marks for interviews and admissions as new applicants continue to submit their scores.
You need to implement a class that, given an integer, k, manages a continuous stream of test scores. Each time a new score is added, the class should return the kth highest score among all scores received so far, i.e., the score that would appear in the
Implement the KthLargest class:
Constructor: Initializes the object with the integer
kand the initial stream of test scoresnums.int add(int val): This function adds a new test score
valto the stream and returns thekthhighest score among all scores seen so far.
Constraints: