692. Top K Frequent Words - LeetCode

import heapq
from collections import Counter


class Solution1:
    def topKFrequent(self, words: list[str], k: int) -> list[str]:
        c = Counter(words)
        return [x for x in sorted(c, key=lambda key: (-c[key], key))][:k]


class Solution:
    def topKFrequent(self, words: list[str], k: int) -> list[str]:
        c = Counter(words)
        return heapq.nsmallest(k, c, key=lambda key: (-c[key], key))