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.
O(n)
O(n)
Run make to build and run C++ files and run Swift files. Or you can run .playground file.