Search
⌘K

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.

Your account is free and you can post anonymously if you choose.