Given an array of size n
, find the majority element. The majority element is the element that appears more than floor(n/2)
times.
You may assume that the array is non-empty and the majority element always exists in the array.
When the solution is called with arr = [ 2, 1, 2 ]
the expected return value is 2
which occurs 2 times which is greater than 3/2.