Solving Majority Element in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

You may assume that the array is non-empty and the majority element always exist in the array.

Example 1:

Input: [3,2,3]
Output: 3

Example 2:

Input: [2,2,1,1,1,2,2]
Output: 2

See the full details of the problem Majority Element at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go