Given an integer array nums, a triplet of indices (i, j, k) is called a good tuple if:

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

• nums[i] == nums[j] == nums[k]

The distance of a tuple (i, j, k) is calculated as abs(i - j) + abs(j - k) + abs(k - i).

Return the minimum distance among all possible good tuples. If no good tuple exists, return $-1$.

Constraints:

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

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

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.