281. Top K Frequent Words

MediumHeap

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.

Examples

Input: ["i","love","leetcode","i","love","coding"] 2

Output: ["i","love"]

Explanation: Both appear twice; 'i' precedes 'love' alphabetically.

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]]
Loading...

Run checks all cases above. Submit evaluates all test cases.