Top K Frequent Words

Try to solve the Top K Frequent Words problem.

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.

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.