169. Majority Element

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

You may assume that the array is non-empty and the majority element always exist in the array.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question.

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        unordered_map <int,int> counts;
        int n = nums.size();
        for(int i=0;i<n;i++)
        {
            counts[nums[i]]++;
            if(counts[nums[i]] > n/2)
                return nums[i];
        }
    }
};