Heap / Priority Queue

Given an array of n integers, find the kth smallest element in the array.

Given an array of n integers, find the kth largest element in the array.

Given a k-sorted array, which is an array where each element is at most k positions away from its sorted position, sort the array.

Given a sorted array, a number X, and a value k, find the k closest numbers to X in the array.

Given a non-empty array of integers, return the k most frequent elements.

Given an array of integers, sort the array in increasing order based on the frequency of the numbers. If multiple numbers have the same frequency, sort them in increasing order.

Given a list of points on a 2D plane, find the K closest points to the origin (0, 0). There can be multiple Solutions, Give any solution out of multiple solutions

Given n ropes of different lengths, connect them into a single rope with the minimum possible cost. The cost to connect two ropes is equal to the sum of their lengths.

Given an array of integers and two integers k1 and k2, find the sum of all elements between the k1'th and k2'th smallest elements of the array.