Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3285. Find Indices of Stable Mountains
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source