You are given an array of positive integers nums.

A quadruplet of indices (p, q, r, s) is called a special subsequence if:

• $0 \leq p < q < r < s <$ nums.length

• $q - p > 1$

• $r - q > 1$

• $s - r > 1$

• nums[p] $\cdot$ nums[r] == nums[q] $\cdot$ nums[s]

Return the total number of special subsequences in nums.

Constraints:

• $7 \leq$ nums.length $\leq 1000$

• $1 \leq$ nums[i] $\leq 1000$

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.