#229 - Majority Element II

Medium • View on LeetCode • View on GitHub

Problem Description

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Solution

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var majorityElement = function(nums) {
  const map = new Map();
  nums.forEach(n => map.set(n, (map.get(n) || 0) + 1));

  return [...map]
    .filter(([key, value]) => value > nums.length / 3)
    .map(([key]) => key);
};