#Heap

Minimize the array sum using repeated halving operations. Solved using a Max Heap where the largest element is repeatedly chosen and reduced.

Write code to find the Kth largest and Kth smallest elements in an unsorted array.

Given a list of meeting time intervals, find the minimum number of meeting rooms required to accommodate all meetings. Use sorting and a min-heap (priority queue) to maintain the earliest ending meeting to efficiently reuse rooms. Example: Input: intervals = [[0,30],[5,10],[15,20]] Output: 2.

Explain a problem that can be effectively solved using heaps. Provide an algorithm or approach that utilizes a heap data structure for the solution.