Find Indices of Stable Mountains

There are n mountains in a row, and each mountain has a height. You are given an integer array height where height[i] represents the height of mountain i, and an integer threshold.

A mountain is called stable if the mountain just before it (if it exists) has a height strictly greater than threshold. Note that mountain 0 is not stable.

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

LeetCode Problem - 3285

class Solution {
    public List<Integer> stableMountains(int[] height, int threshold) {
        // Create a list to store the indices of stable mountains
        List<Integer> list = new ArrayList<>();

        // Loop through the height array, starting from the second element
        for (int i = 1; i < height.length; i++) {
            // Check if the previous height is greater than the given threshold
            if (height[i - 1] > threshold) {
                // If it is, add the current index to the list (i is stable)
                list.add(i);
            }
        }

        // Return the list of indices for stable mountains
        return list;
    }
}