GoLang Solution For LeetCode Problem: Element Appearing More Than In Sorted Array

Solving Element Appearing More Than In Sorted Array in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Return that integer.

Example 1:

Input: arr = [1,2,2,6,6,6,6,7,10]
Output: 6

Constraints:

• 1 <= arr.length <= 10^4

• 0 <= arr[i] <= 10^5

• 1 <= arr.length <= 10^4

• 0 <= arr[i] <= 10^5

See the full details of the problem Element Appearing More Than In Sorted Array at LeetCode

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