Leetcode - Top K Frequent Elements Solution — The Poor Coder

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:

Text

Input: nums = [1,1,1,2,2,3], k = 2
Output: [1,2]

Example 2:

Text

Input: nums = [1], k = 1
Output: [1]

Constraints:

1 <= nums.length <= 10⁵
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.

Solution in Python#

Python

from collections import Counter
class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        return [x for x,y in Counter(nums).most_common()[:k]]

Apr 242021

Leetcode - Design Twitter Solution

Design a simplified version of Twitter where users can post tweets, follow/unfollow another user, and is able to see the 10 most recent tweets in the user's news feed. Implement the Twitter class: Twitter() Initializes…

leetcode Hash Table heap4 min read

May 112021

Leetcode - Count Good Meals Solution

A good meal is a meal that contains exactly two different food items with a sum of deliciousness equal to a power of two. You can pick any two different foods to make a good meal. Given an array of integers…

leetcode array Hash Table2 min read

May 112021

Leetcode - Number of Good Pairs Solution

Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Example 2: Example 3: Constraints: 1 <= nums.length <= 100 1 <= nums[i] <= 100…

leetcode array Hash Table1 min read

Solution in Python#

Related posts

Leetcode - Design Twitter Solution

Leetcode - Count Good Meals Solution

Leetcode - Number of Good Pairs Solution