Peak Index in a Mountain Array Problem

Peak Index in a Mountain Array Problem — ExecCode Medium DSA Practice

Solve the Peak Index in a Mountain Array problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Peak Index in a Mountain Array. Binary search bitonic peak. For Peak Index in a Mountain Array, focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

Input {"arr": [0, 2, 1, 0]}; Output 1

Constraints

1 ≤ n ≤ 10^5

Practice Peak Index in a Mountain Array free on ExecCode. Browse DSA problems, topic map, and placement guides.