Majority Element

Time Complexity - $O()$

class Solution:
 
    def majorityElement(self, nums: List[int]) -> int:
 
        n = len(nums)
 
        nums = sorted(nums)
 
        return nums[n//2]

The majority elements appears more than half times, so the middle element is always the majority element.

Related: