## 692. Top K Frequent Words

Given a non-empty list of words, return the k most frequent elements.

Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the lower alphabetical order comes first.

Example 1:

Input: ["i", "love", "leetcode", "i", "love", "coding"], k = 2
Output: ["i", "love"]
Explanation: "i" and "love" are the two most frequent words.
Note that "i" comes before "love" due to a lower alphabetical order.

Example 2:

Input: ["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"], k = 4
Output: ["the", "is", "sunny", "day"]
Explanation: "the", "is", "sunny" and "day" are the four most frequent words,
with the number of occurrence being 4, 3, 2 and 1 respectively.

Note:

1. You may assume k is always valid, 1 ≤ k ≤ number of unique elements.
2. Input words contain only lowercase letters.

1. Try to solve it in O(n log k) time and O(n) extra space.

## Rust Solution

struct Solution;
use std::cmp::Ordering;
use std::collections::HashMap;
struct Pair<'a> {
word: &'a str,
freq: usize,
}

impl Solution {
fn top_k_frequent(words: Vec<String>, k: i32) -> Vec<String> {
let mut hm: HashMap<&str, usize> = HashMap::new();
let mut v: Vec<Pair> = vec![];
for w in words.iter() {
*hm.entry(w).or_default() += 1;
}
for (word, freq) in hm {
v.push(Pair { word, freq });
}
v.sort_unstable_by(|a, b| match b.freq.cmp(&a.freq) {
Ordering::Equal => a.word.cmp(b.word),
e => e,
});
v.iter()
.take(k as usize)
.map(|x| x.word.to_string())
.collect()
}
}

#[test]
fn test() {
let words: Vec<String> = vec_string!["i", "love", "leetcode", "i", "love", "coding"];
let res: Vec<String> = vec_string!["i", "love"];
let k = 2;
assert_eq!(Solution::top_k_frequent(words, k), res);
let words: Vec<String> =
vec_string!["the", "day", "is", "sunny", "the", "the", "the", "sunny", "is", "is"];
let res: Vec<String> = vec_string!["the", "is", "sunny", "day"];
let k = 4;
assert_eq!(Solution::top_k_frequent(words, k), res);
}

Having problems with this solution? Click here to submit an issue on github.