Answer: JPMorgan OA Question 2024 June | Heap | on-campus

Solution: Kth Largest Element — Min Heap of Size K Approach We use a Min Heap of size K. The idea is to maintain a heap that always holds the K largest elements seen so far. The top of the min heap (the minimum among the K largest) is our answer. For each number, add it to the min heap. If the heap size exceeds K, remove the smallest element (top of min heap). After processing all numbers, the top ...