Given an integer array nums, return the total number of stable subsequences.

A subsequence of an array nums is considered stable if it is non empty and does not contain $3$ consecutive elements with the same parity (that is, it does not contain $3$ consecutive even integers or $3$ consecutive odd integers).

Note: A subsequence is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements.

Constraints:

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

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