Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms

Problem: Top K Frequent Elements

Explore how to identify the top k frequent elements in an integer array using a min heap. Learn to create a frequency map, maintain a heap of k elements by frequency, and achieve better than O(n log n) complexity with Python's heapq.

We'll cover the following...

Statement

You are given an integer array nums and an integer k. Your task is to find the k elements that appear most frequently in nums. The result may be returned in any order.

Note: As a follow up, try to design an algorithm with time complexity better than O(nlog⁡n)O(n \log n), where nn is the size of the array.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5

  • −104≤-10^4 \leq nums[i] ...