Top k most frequent in Rust
Rust interview exercise on Practical, difficulty 3 of 3. Solve it in the editor beside a worked example; the tests run the moment you do.
Write top_k_frequent(words, k) that returns the k most frequent words, most frequent first, with ties broken alphabetically. A HashMap iterates in no particular order, so the sort has to decide everything.
Each exercise pairs a worked example with a twin problem to solve in a real editor; the tests run the moment you do. Progress is saved in your browser, and in your account if you sign in.