You are given an integer array prices representing the daily price of a stock.

A smooth descent period of a stock consists of one or more contiguous days such that the price on each day is lower than the price on the preceding day by exactly $1$. Specifically, for any consecutive days in the period, the condition prices[i] - prices[i + 1] $= 1$ holds.

Return the total number of smooth descent periods.

Note: A period consisting of a single day is also considered a smooth descent period.

Constraints:

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

• $1 \leq$ prices[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.