Top K Frequent Words
Given an array of strings words and an integer k, return the k most frequent strings.
Return the answer sorted by the frequency from highest to lowest. Sort the words with the same frequency by their lexicographical order.
Follow-up: Could you solve it in O(n log(k)) time and O(n) extra space?
Example 1
Input
words = ["i","love","leetcode","i","love","coding"], k = 2Output
["i","love"]"i" and "love" are the two most frequent words, and "i" comes before "love" due to a lower alphabetical order.
Example 2
Input
words = ["the","day","is","sunny","the","the","the","sunny","is","is"], k = 4Output
["the","is","sunny","day"]"the", "is", "sunny", and "day" are the four most frequent words, with occurrence counts 4, 3, 2, and 1 respectively.
Constraints
- 1 <= words.length <= 500
- 1 <= words[i].length <= 10
- words[i] consists of lowercase English letters.
- k is in the range [1, The number of unique words[i]]