<p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>

<p>We call a subarray of an array <strong>complete</strong> if the following condition is satisfied:</p>

<ul>
	<li>The number of <strong>distinct</strong> elements in the subarray is equal to the number of distinct elements in the whole array.</li>
</ul>

<p>Return <em>the number of <strong>complete</strong> subarrays</em>.</p>

<p>A <strong>subarray</strong> is a contiguous non-empty part of an array.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,3,1,2,2]
<strong>Output:</strong> 4
<strong>Explanation:</strong> The complete subarrays are the following: [1,3,1,2], [1,3,1,2,2], [3,1,2] and [3,1,2,2].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,5,5,5]
<strong>Output:</strong> 10
<strong>Explanation:</strong> The array consists only of the integer 5, so any subarray is complete. The number of subarrays that we can choose is 10.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 2000</code></li>
</ul>

class Solution:
    def countCompleteSubarrays(self, nums: List[int]) -> int:
        # 1 3 1 2 2 

        # 1,2,3

        # compute all subarrays
        # must be at least 3 elements

        # array -> hashmap
        # 2 pointer (binary search, SW), Stack

        # all possible subarrays starting at index i

        # subarrays of length: n -> len(nums)
        unique_items = set(nums)
        n = len(unique_items)
        res = 0

        for size in range(n, len(nums) + 1):
            subarr = nums[0:size]
            tracker = Counter(subarr)
            sofar = len(tracker.keys())
            if sofar == n:
                res += 1
            s = 0
            for e in range(size, len(nums)):
                tracker[nums[s]] -= 1
                if tracker[nums[s]] == 0:
                    sofar -= 1
                if nums[e] not in tracker or tracker[nums[e]] == 0:
                    sofar += 1
                    tracker[nums[e]] = 1
                else:
                    tracker[nums[e]] += 1
                if sofar == n:
                    res += 1
                s += 1
        return res


1039