Arrays & Hashing pattern
Top K Frequent Elements
Given an integer array and a number k, return the k most frequent elements. The answer is guaranteed to be unique; it may be returned in any order. Watch it run step by step, then write your own pseudocode and get it checked by AI.
- LeetCode 347
- Medium
- 2 approaches
Sign in with Google or GitHub and you land straight on this page. DSA comes with the all labs plan and every ChaiCode batch.
Arrays & HashingLeetCode 347
Medium
From the first idea to the best one
- 01 Count + sort O(n log n)O(n) space
- 02 Optimized · bucket sort O(n)O(n) space
What you will learn
- How to read Top K Frequent Elements and spot the arrays & hashing pattern in it
- Count + sort: O(n log n) time, O(n) space
- Optimized · bucket sort: O(n) time, O(n) space
- The pseudocode for each approach, its line lit as the animation runs
- Practice: write your own pseudocode and get it checked
More Arrays & Hashing
See Top K Frequent Elements run, step by step
Sign in and this page opens on the animation, with all 13 Arrays & Hashing problems beside it.
DSA comes with the all labs plan and every ChaiCode batch.