Slug: heap-topfreq-01 · Paired reading: Chapter 20
Prompt
fn top_k_frequent(nums: &[i32], k: usize) -> Vec<i32> — k most frequent
elements (any order). HashMap counts + min-heap of size k, or bucket sort.
Enter your book access code
The curriculum, drills, tutor, and interviewer mode are for readers of Ace the Rust Interview. The code is printed in the Preface (Companion site access).
Don’t have the book yet? Get it on Amazon (US and other storefronts linked in the site footer) — the Preface access code unlocks this gym.
intermediate · order 126