There is a line chart plotted on a $2\text{D}$ plane using an integer array y of length n. The chart consists of $n - 1$ line segments connecting consecutive points $(i + 1, y[i])$ and $(i + 2, y[i + 1])$ for all $0 \leq i < n - 1$.

A horizontal line intersects a line segment if they share at least one common point.

Return the maximum number of intersections that a horizontal line can have with the chart.

Constraints:

• $2 \leq$ y.length $\leq 10^5$

• $1 \leq$ y[i] $\leq 10^9$

• y[i] != y[i + 1] for i in range $[0, n - 2]$

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.