You’re given a 0-indexed integer array nums. An index i is called a peak if nums[i] is strictly greater than its neighboring values (the elements immediately to its left and right, if they exist). Assume the array has virtual boundaries where nums[-1] = nums[n] = -∞, so the first and last elements can also be peaks.

Your task is to return the index of any one peak element (if there are multiple peaks, any valid peak index is acceptable), and your solution must run in $O(\log n)$ time.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $-2^{31} \leq$ nums[i] $\leq 2^{31} - 1$

• nums[i] != nums[i + 1] for all valid i.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.