Leetcode Problem 703. Kth Largest Element in a Stream

703. Kth Largest Element in a Stream

Leetcode Solutions

Initialize the min-heap with the elements from the input array nums.
If the size of the heap is greater than k, remove elements until the size is exactly k.
For each add operation, insert the new value val into the heap if the heap size is less than k or if val is greater than the root of the heap.
If the heap size exceeds k after insertion, remove the root of the heap.
Return the root of the heap as the kth largest element.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen