Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2951. Find the Peaks
Find all indices (excluding the first and last) in the array mountain where the element is strictly greater than both neighbors. Return those peak indices in any order; constraints are small (3 ≤ n ≤ 100), so a single pass suffices.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.