> For the complete documentation index, see [llms.txt](https://docs-57.gitbook.io/data-structure-and-algorithms/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://docs-57.gitbook.io/data-structure-and-algorithms/problems/heap/top-k-frequent-elements.md).

# Top K Frequent Elements

\
**Example 1:**

<pre><code><strong>Input: nums = [1,1,1,2,2,3], k = 2
</strong><strong>Output: [1,2]
</strong></code></pre>

**Example 2:**

<pre><code><strong>Input: nums = [1], k = 1
</strong><strong>Output: [1]
</strong></code></pre>

&#x20;

**Constraints:**

* `1 <= nums.length <= 105`
* `-104 <= nums[i] <= 104`
* `k` is in the range `[1, the number of unique elements in the array]`.
* It is **guaranteed** that the answer is **unique**.

&#x20;Solutions

Approach - Sorting Technique

Steps