Leetcode 692. Top K Frequent Words


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.
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.
  1. Input words contain only lowercase letters.
  1. know how to write a comparator priority queue sorting function
  2. sorting: map.key number bigger -> smaller ; if key is same, compare alphbet order; queue: smaller to bigger
  1. using Map<String, Integer> and map.entrySet()

CS new grad, 6 years experience related to supply chain management. Located in Bay area