terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#347
Top K Frequent Elements
Medium
Acceptance 0%
Editorial
description
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.
checklist
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].
science
Examples
Case #1
In:
nums = [1,1,1,2,2,3] k = 2
Out:
[1,2]
Case #2
In:
nums = [1] k = 1
Out:
[1]
Mastery Tags
Arrays
Hash Table
Heap
Sorting
Hiring Companies
Amazon
Google
Meta
code
Integrated IDE
Python 3
expand_more
C
C++ 17
Java
JavaScript
Python 3
C
C++ 17
Java
JavaScript
Python 3
refresh
class Solution: def topKFrequent(self, nums: list[int], k: int) -> list[int]: pass
Login to Compile
Processing
terminal
Debug Output
home
Home
extension
Practice
robot_2
login
Sign In
account_circle
Menu
code_blocks
Coding
psychology
Aptitude
Navigation
close
Login
Registration