kth element

Find the kth largest element in a data stream. Implement stream processing to handle the kth largest element in each time window of a large data stream. Use a queue to manage the time window and buckets to store the frequency of ranges (because of memory limits). Example Input k = 3, nums = [4, 5, 8, 2] Output KthLargest(3, [4, 5, 8, 2])