Leetcode 3285. Find Indices of Stable Mountains

Given an array height and an integer threshold, return all indices i > 0 such that the previous mountain's height (height[i-1]) is strictly greater than threshold (mountain 0 is never stable). Essentially scan adjacent pairs and collect positions whose left neighbor exceeds the threshold.