C#/Java/Python solutions for Leetcode question: Majority Element (difficulty : easy)
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.
My C#/Java/Python solutions is here: