---
title: "692. Top K Frequent Words"
url: "https://laigary.com/interview/coding/692-top-k-frequent-words"
type: "note"
section: "coding"
date: "2023-01-29"
updated: "2025-03-31"
tags: ["Heap"]
---

# 692. Top K Frequent Words

[692\. Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)

直接透過 Heap 的特性來完成。

```python
class Solution:
    def topKFrequent(self, words: List[str], k: int) -> List[str]:
        counter = Counter(words)
        q = []
        heapq.heapify(q)
        for key, value in counter.items():
            heapq.heappush(q, (-value, key))
        res = heapq.nsmallest(k, q)
        return [value for key, value in res]

```