Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2345. Finding the Number of Visible Mountains
Given mountains as (x,height) that span intervals [x-height, x+height], count how many mountains are not completely covered by any other mountain; the core challenge is detecting interval containment efficiently (typically via sorting by left endpoint and scanning while handling equal intervals/duplicates).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.