Finding the k’th Largest Element in an Infinite Integer Stream
Given an infinite stream of integers, find the k’th largest element at any point of time. It may be assumed that 1 <= k <= n. Example: Input: stream[] = {10, 20, 11, 70, 50, 40, 100, 5, …} k = 3 Output: {-1, -1, 10, 11, 20, 40, 50, 50, …} Extra space allowed is O(n).… Read More »