1985. Find the Kth Largest Integer in the Array
heapq library to obtain the kth largest number in O(n * log(k * m)) time.
Read more ⟶
215. Kth Largest Element in an Array
heapq to obtain the k largest number in O(nlogk) time.
Read more ⟶
347. Top K Frequent Elements
heapq to obtain the top k frequent numbers in O(nlogk) time
Read more ⟶
75. Sort Colors
This is the famous "Dutch National Flag" problem.
Read more ⟶