LeetCode 2345: Finding Visible Mountains | Google Interview Problem | Python

Let’s solve LeetCode 2345 – Finding the Number of Visible Mountains.

At first, this problem looks like pure geometry, but once you break it down, it becomes an intervals problem with tricky edge cases.

✅ In this video, I’ll cover:

How to transform mountains into intervals using (x – y, x + y)

Why sorting by start + max length is critical

The hidden edge case where peaks overlap at the same point

Step-by-step Python solution that avoids common pitfalls

This is a Google-style question that tests interval merging, sorting logic, and careful edge case handling.

#leetcode #googleinterview #python #codinginterview #bighead

Видео LeetCode 2345: Finding Visible Mountains | Google Interview Problem | Python канала codersmanual