← Search

Micro-Drill #71 — K largest elements

Search Target: 10s

nlargest uses a min-heap of size k internally. O(n log k) for top-k problems.

import heapq
top_k = heapq.nlargest(k, a)

Type it from memory. Go.

Practice Problems

• 215. Kth Largest Element in an Array
• 347. Top K Frequent Elements

Related Coding Drills

• Drill #59 — Top K frequent elements Medium
• Drill #7 — Sliding window max sum of k elements Easy
• Drill #62 — Merge K sorted arrays Medium