Available question text
Find the length of the longest contiguous "mountain" subarray — a strictly increasing sequence immediately followed by a strictly decreasing sequence with length ≥ 3 — or return 0 if none exists. The core challenge is detecting peaks and measuring maximal increasing-then-decreasing windows efficiently (ideally in one pass and O(1) space).
Related questions
Continue with questions that share topics or the same question type.
- Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
- Trapping Rain Water
Coding · Array · Dynamic Programming · Monotonic Stack
- Longest Increasing Subsequence
Coding · Array · Binary Search · Dynamic Programming
- Longest Palindromic Substring
Coding · Dynamic Programming · Manacher · String
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Oracle
Leetcode 845. Longest Mountain in Array
Reported Nov 5, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
TikTok
Longest Mountain in Array
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 52.7. This is not an interview probability.
View source