Available question text
Given lamps along a street where each lamp illuminates a contiguous range of positions, count how many positions receive exactly a target brightness from overlapping lamp contributions. The core challenge is aggregating many interval contributions efficiently (difference array / prefix-sum or sliding-window) to avoid O(n^2) work.
Related questions
Continue with questions that share topics or the same question type.
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 2237. Count Positions on Street With Required Brightness
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source