# Finding The Number Of Visible Mountains: Explained

Finding The Number Of Visible Mountains shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Points (x,y) are peaks of isosceles triangles from (x-y,0) to (x+y,0). A peak is hidden if another peak's triangle covers it. Sort by left edge ascending and right edge descending; scan and count a peak if its right edge strictly extends past the max right seen (duplicates of the same triangle are all hidden).

## 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 log n).

## Common mistake

Comparing heights at the same x only, or counting duplicate identical peaks as visible.

## 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 Linkjob.