Skip to Content
PracticeProblems.org

Majority Element

Home | Coding Interviews | Miscellaneous | Majority Element
MiscellaneousEasyVideoPythonCode Solution

Given an array nums of size n, return the majority element.

The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.

#Moore Voting Algorithm
class Solution:
    def majorityElement(self, nums: List[int]) -> int:
        count = 0
        candidate = 0
        
        for num in nums:
            if count == 0:
                candidate = num
            
            if num == candidate:
                count += 1
            else:
                count -= 1
        
        return candidate

Posted by Jamie Meyer 25 days ago