Level 5Exercise #110
Top-k frequent via heap
Return the k most frequent values using Counter and a heap helper.
What you’ll practice
This Level 5 exercise focuses on Counter + heap in the Algorithms curriculum. Solve the challenge prompt above using clear, idiomatic Python and the relevant language or standard-library tools.
Relevant Python reference: collections.Counter.
Sample Test Cases
Example #1
Input:
top_k_frequent([1,1,1,2,2,3], k=2)Output:
[1,2]Further Reading
Reference Solution
Reveal Reference Solution
def top_k_frequent(values: list[int], k: int) -> list[int]: import heapq from collections import Counter counts = Counter(values) return heapq.nlargest(k, counts, key=counts.get)Pro Tips & Keyboard Shortcuts
Color Theme
Ctrl + K then T
Open VS Code Color Theme Quick Pick to select from 20 dark and light themes.
Editor SettingsCtrl + K
Open practice settings drawer to toggle line numbers, indenting, font size & hints.
Search MenuCtrl + /
Expand sidebar menu, focus search bar, and highlight search text instantly.
Focus Code Editor
Esc or Ctrl + `
Instantly highlight and focus code editor from anywhere, restoring cursor right where you left off.
Normal ViewEsc
Collapse sidebar and close all popups or settings drawers for clean focus view.