package
Version:
v1.6.5
Opens a new window with list of versions in this module.
Published: Mar 23, 2021
License: MIT
Opens a new window with license information.
Imports: 0
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
README
¶
< Previous
Next >
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.legth <= 105
k
is in the range [1, the number of unique elements in the array]
.
- It is guaranteed that the answer is unique.
Follow up: Your algorithm's time complexity must be better than O(n log n)
, where n is the array's size.
[Heap]
[Hash Table]
Similar Questions
- Word Frequency (Medium)
- Kth Largest Element in an Array (Medium)
- Sort Characters By Frequency (Medium)
- Split Array into Consecutive Subsequences (Medium)
- Top K Frequent Words (Medium)
- K Closest Points to Origin (Medium)
Documentation
¶
There is no documentation for this package.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.