🚀 JS | ✅ majority Element solution

first you should know implementation of Map Data Structure

solution Steps:

• first store array elements in Map data structure

• then check which element id major

✅ Javascript code implementation:-

var majorityElement = function (nums) {
    const map = new Map();
    const result = [];

    for (let i = 0; i < nums.length; i++) {
        map.set(nums[i], (map.get(nums[i]) || 0) + 1);
    }

    for (const [key, value] of map.entries()) {
        result.push({ key: key, value: value });
    }

    return result.sort((a, b) => b.value - a.value)[0].key;
};

📢Leetcode Solution

🚀Runtime: 65 ms, faster than 27.81% of JavaScript online submissions for Majority Element.

🚀Memory Usage: 43.7 MB, less than 64.71% of JavaScript online submissions for Majority Element.

📢 Follow on LinkedIn

📢 Follow on Leetcode