You are given a $2$D integer array stockPrices where stockPrices[i] = [day_i, price_i] represents the price of a stock on day day_i as price_i. A line chart is created by plotting each point on a Cartesian plane and drawing straight line segments between consecutive points sorted in ascending order of their day values.

Return the minimum number of line segments required to represent the full line chart.

Constraints:

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

• stockPrices[i].length $= 2$

• $1 \leq$ day_i, price_i $\leq 10^9$

• All day_i are distinct.

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.