Available question text
Check whether the array has length at least 3 and there exists a single peak index 0 < i < n-1 such that the values strictly increase up to i and then strictly decrease after i. In other words, verify the sequence is strictly increasing then strictly decreasing with the peak not at an endpoint.
Related questions
Continue with questions that share topics or the same question type.
- Check if There is a Valid Partition For The Array
Coding
- Find in Mountain Array
Coding
- Longest Mountain in Array
Coding · Array · Dynamic Programming · Enumeration
- Minimum Adjacent Swaps to Make a Valid Array
Coding
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 941. Valid Mountain Array
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source