Most searched words

mediumHeapsHash maps and sets target 25 min

Most searched words

Not solved yetLeetCode 692. Top K Frequent Words

You get a list words from a search log, one word per search, and an integer k. Return the k words that were searched most often, as a list ordered from most searched to least.

When two words were searched the same number of times, the one that comes first alphabetically goes first. Alphabetical order here is the order Python's < gives for strings, so "ab" comes before "abc".

k is at least 1 and at most the number of different words.

Example 1

Inputwords = ["sql", "join", "sql", "index", "join", "sql"], k = 2Output["sql", "join"]

"sql" was searched 3 times, "join" 2 times and "index" once.

Example 2

Inputwords = ["map", "heap", "trie", "heap", "map", "set"], k = 3Output["heap", "map", "set"]

"heap" and "map" tie at 2, and "heap" comes first alphabetically. "set" and "trie" tie at 1 and only one fits: "set" comes first.

Constraints

1 ≤ len(words) ≤ 10⁵
Each word has 1 to 10 lowercase English letters.
1 ≤ k ≤ the number of different words

Plan it first

Write a line for each before you code, then say them out loud. Compare with the Approach tab afterwards.

Walk In what order will you visit the input?Notebook What will you write down as you go?Promise What stays true after every step?Cost Time and space, in Big O.

Run examples checks the examples. Submit runs every test, including edge cases and, when the problem has one, a speed check on a large input.

Same pattern