Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Top K Frequent Words

Explore how to implement a solution that returns the top K most frequent words from a list, using a combination of tries and bucket sort. This lesson guides you through counting frequencies, organizing words by frequency, and retrieving results sorted by frequency and lexicographical order with optimal time and space complexity.

We'll cover the following...

Statement

Given a list of strings words and an integer k, return the k most frequently occurring strings.

Note: The result should be sorted in descending order based on frequency. If multiple words have the same frequency, they should be sorted in lexicographical order.

Constraints:

  • 1≤1 \leq words.length ≤100\leq 100

  • 1≤1 \leq words[i].length ≤10\leq 10

  • 1≤1 \leqk ≤\leq number of unique words in the list

  • words[i] consists of lowercase English letters. ...

Solution