Majority Element

Problem:

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.

The Majority element has to appear strictly greater n/2 times. If n = 15 then the majority element has to appear 8 times. If n = 20, then the majority element has to appear 11 times.

Hints and Answer Checklist