Search
⌘K
Leetcode 692. Top K Frequent Words
Count word frequencies and return the k most frequent words sorted by descending frequency, breaking ties by lexicographical order. The core challenge is combining frequency counting with an efficient top-k selection (e.g., hash map plus a min-heap or partial sort) to meet the O(n log k) time / O(n) space follow-up.
Asked at:
Apple
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid March, 2026
Apple
Staff
- Given a parse log with user id, time stamp and query find top k queries. - What if this doesn't fit in memory
Hello Interview Premium
Your account is free and you can post anonymously if you choose.