LeetCode 347: Top K Frequent Elements #70
Description
LeetCode 347: Top K Frequent Elements
Category: Heap
Difficulty: See LeetCode
Solution File: src/heap/top_k_frequent_elements.py
Test File: tests/test_top_k_frequent_elements.py
Problem Description
Given an integer array nums and an integer k, return the k most frequent elements.
You may return the answer in any order.
Example 1:
Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]
Example 2:
Input: nums = [1], k = 1
Output: [1]
Constraints:
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
- k is in the range [1, the number of unique elements in the array]
Tasks
- Implement the solution in
src/heap/top_k_frequent_elements.py - Ensure all test cases pass
- Analyze time complexity
- Analyze space complexity