Top-K Problems
Find the $k$ largest/most frequent items with a size-$k$ heap in $O(n\log k)$, or quickselect in $O(n)$ average.
Easy
heapq.nlargest(k, items).
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.