You are given a $0$ indexed integer array mountain.

An element is considered a peak if it is strictly greater than both its adjacent left and right neighbors.

Return an array containing the indices of all peaks in mountain in any order.

Note: The first and last elements of mountain cannot be peaks.

Constraints:

• $3 \leq$ mountain.length $\leq 100$

• $1 \leq$ mountain[i] $\leq 100$

Now, 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.