You are given an array of integers nums.

A subarray of nums is called continuous if, for any two elements at indices i and j in the subarray, $|$nums[i] - nums[j]$| \leq 2$.

Return the total number of continuous subarrays in nums.

Note: A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

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

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

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.