Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Maximum Number of Visible Points
Coding · Array · Geometry · Math
- Number of Visible People in a Queue
Coding
- Number of Ways to Rearrange Sticks With K Sticks Visible
Coding
- 1. Count number of islands in matrix (Leetcode challenge)
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2345. Finding the Number of Visible Mountains
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source