You are given a $0$ indexed array of positive integers nums.

Find the total number of index triplets (i, j, k) that satisfy all of the following conditions:

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

• nums[i] \neq nums[j]

• nums[i] \neq nums[k]

• nums[j] \neq nums[k]

Return the total count of such valid triplets.

Constraints:

• $3 \leq$ nums.length $\leq 100$

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