Day 6 of 31-Day May LeetCode Challenge

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 exists in the array.

5 different approaches are discussed .