Leetcode 2237. Count Positions on Street With Required Brightness

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.