#Sorting

Solve a Dynamic Programming problem where sorting and mathematical observation lead to an optimal solution.

Describe the Quick Sort algorithm and its efficiency.

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.

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