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

Problem Description

A peak element is an element that is greater than its neighbors.

The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.

Example 1: 

Input: nums = [1,2,3,1]
Output: 2
Explanation: 3 is a peak element and your function should return the index number 2.

Example 2: 

Input: nums = [1,2,1,3,5,6,4]
Output: 1 or 5 
Explanation: Your function can return either index number 1 where the peak element is 2, 
             or index number 5 where the peak element is 6.

Note:

Your solution should be in logarithmic complexity.

See the full details of the problem Find Peak Element at LeetCode

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