Top K Frequent Elements
#347
Medium
Array & Hashing
O(n log k)
O(n + k)
Amazon
Facebook
Microsoft
Yelp
Problem Description
Given an integer array nums and an integer k, return the k most frequent elements.
Given an integer array nums and an integer k, return the k most frequent elements.