Given an integer array nums, return the total number of special triplets (i, j, k).

A triplet of indices (i, j, k) is called special if all the following conditions are satisfied:

• $0 \leq i < j < k <$ nums.length

• nums[i] $= 2 imes$ nums[j]

• nums[k] $= 2 imes$ nums[j]

Constraints:

• $3 \leq n ==$ nums.length $\leq 10^5$

• $0 \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.