#Sorting

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.

Return the top-k most frequent words from a list, sorted by frequency and then by lexicographical order.

Implement a K-distance sort on an array to achieve O(n log k) performance using a min-heap.

Find the K most frequent words in a list, sorted by frequency and lexicographical order.

Implement a polyfill for the Array.prototype.sort() method using Quick Sort. Explain how the recursion works in your implementation and what edge cases should be considered.