A street is represented by a number line. You are given a $2$D integer array lights where lights[i] = [position_i, range_i] indicates that there is a street lamp at coordinate position_i that illuminates the inclusive interval $[`position_i` - `range_i`, `position_i` + `range_i`]$.

The brightness of a position is defined as the total number of lamps illuminating that position.

Return the brightest position on the street. If multiple positions share the maximum brightness, return the smallest position among them.

Constraints:

• $1 \leq$ lights.length $\leq 10^5$

• lights[i].length $= 2$

• $-10^8 \leq$ position_i $\leq 10^8$

• $0 \leq$ range_i $\leq 10^8$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.