You are given a $0$ indexed $2$D integer array peaks where peaks[i] = [x_i, y_i] represents the peak coordinates of the $i$th mountain.

Each mountain is shaped as an isosceles right triangle with its base on the x axis and its right angle at the peak (x_i, y_i). A mountain covers the horizontal interval from $x_i - y_i$ to $x_i + y_i$ on the line $y = 0$.

A mountain is considered visible if its peak does not lie strictly inside or on the boundary of any other mountain.

Return the total number of visible mountains.

Note: If multiple mountains have the exact same peak coordinates, they completely overlap and none of them are considered visible.

Constraints:

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

• peaks[i].length $= 2$

• $1 \leq$ x_i, y_i $\leq 10^5$

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.