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 \leq$ words.length $\leq 100$
$1 \leq$ words[i].length $\leq 10$
$1 \leq$ k $\leq$ number of unique words in the list
words[i] consists of lowercase English letters.

Solution

This solution utilizes the trie data structure and bucket sort method to find the top k elements in a list. It achieves this by combining a bucket sort technique (which groups words based on their frequencies), a trie (which stores words in an organized manner), and a frequency map (which counts the occurrences of each word). ...