# Longest Mountain In Array: Practice Notes

Longest Mountain In Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A mountain is a contiguous subarray that strictly increases then strictly decreases (length >= 3). One pass: walk up, then walk down, record the length if both sides are nonempty, and start the next candidate at the bottom.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Allowing plateaus (equal neighbors) inside the mountain, or counting a pure ascent or descent.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI assistant for technical interviews.