Search
⌘K

Leetcode 2021. Brightest Position on Street

Given lights described by a position and illumination range, find the street coordinate that is covered by the maximum number of lights (return the smallest coordinate on ties). This is an interval-overlap problem—compute where intervals [pos-range, pos+range] overlap most (e.g., via sweep-line/event counting).


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

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