You are given an integer array height representing the heights of $n$ mountains, and an integer threshold.

A mountain at index i (where $1 \leq i < n$) is considered stable if the mountain immediately before it has a height strictly greater than threshold, which means height[i - 1] > threshold. Mountain $0$ is not stable.

Return an array containing the indices of all stable mountains in any order.

Constraints:

• $2 \leq n ==$ height.length $\leq 100$

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

• $1 \leq$ threshold $\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.