LeetCode – Majority Element (Java)

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. (assume that the array is non-empty and the majority element always exist in the array.) Java Solution 1 – Sorting Assuming the majority exists and since the majority always takes more … Read more