Demonstrate pushing and popping elements from a min-heap.
Convert an arbitrary array into a min-heap in-place.
Given an array of integers and k, return the k most frequent elements.
Given an n x n matrix where rows and columns are sorted, find the kth smallest element.
Given meeting intervals [start, end], find minimum conference rooms required.
Given k sorted arrays, merge them into one sorted array.
Shortest path from source in a weighted graph.
Given meeting time intervals, find the minimum number of conference rooms required.
Given intervals and queries (points), for each query find the size of the smallest interval containing it.
Find the kth largest element in an unsorted array.