Peak Element in a Mountain Array

[its-amans]

Problem Description:

You are given an integer mountain array (arr) of length n where the values increase to a peak element and then decrease.

Return the index of the peak element.

Your task is to solve it in O(log(n)) time complexity.

Example 1:

Input: arr = [0,1,0]

Output: 1

Example 2:

Input: arr = [0,2,1,0]

Output: 1

Constraints:

3 <= arr.length <= 105
0 <= arr[i] <= 106

[github-actions]

Thank you for raising a issue, Hope you enjoing the open source. we try to reply or assign as soon possibe. Connect with mentor.

[its-amans]

Hi @Saloni6111
I would like to implement cpp solution of this Problem . Please assign this problem to me

[its-amans]

@Saloni6111 Is there any issue in problem ?