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

Solution: Top K Frequent Words

Explore how to solve the problem of finding the top k frequent words using a trie data structure paired with bucket sort. This lesson helps you build an efficient solution by counting word frequencies, organizing words in tries by frequency, and then retrieving the top k words sorted by frequency and lexicographical order.

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