You are given an array of positive integers nums.

A subarray is defined as complete if the number of distinct elements present in the subarray equals the total number of distinct elements in the entire array nums.

Return the total count of complete subarrays in nums.

Note: A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

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

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

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.