<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the number of <strong>good subarrays</strong> of </em><code>nums</code>.</p>

<p>A <strong>good array</strong> is an array where the number of different integers in that array is exactly <code>k</code>.</p>

<ul>
	<li>For example, <code>[1,2,3,1,2]</code> has <code>3</code> different integers: <code>1</code>, <code>2</code>, and <code>3</code>.</li>
</ul>

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

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

<pre>
<strong>Input:</strong> nums = [1,2,1,2,3], k = 2
<strong>Output:</strong> 7
<strong>Explanation:</strong> Subarrays formed with exactly 2 different integers: [1,2], [2,1], [1,2], [2,3], [1,2,1], [2,1,2], [1,2,1,2]
</pre>

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

<pre>
<strong>Input:</strong> nums = [1,2,1,3,4], k = 3
<strong>Output:</strong> 3
<strong>Explanation:</strong> Subarrays formed with exactly 3 different integers: [1,2,1,3], [2,1,3], [1,3,4].
</pre>

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

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>1 &lt;= nums[i], k &lt;= nums.length</code></li>
</ul>

class Solution {
public:
    int getMinimumLatestIndex(const unordered_map<int, pair<int, int>>& myMap) {
        int minLatestIndex = INT_MAX;
        // Iterate through the map to find the minimum latest_index
        for (const auto& entry : myMap) {
            int latestIndex = entry.second.second; // Access latest_index (second element of pair)
            minLatestIndex = min(minLatestIndex, latestIndex);
        }
        return minLatestIndex;
    }

    int kandmoredistinct(vector<int>& nums, int k){
        int n=nums.size();

        unordered_map<int,pair<int,int>>mpp;
        int l=0;
        int count =0;
        for(int r=0;r<n;r++){
            mpp[nums[r]].first++;
            mpp[nums[r]].second=r;
            cout<<"r="<<r<<" ";
            while(mpp.size()>k){
                cout<<"l="<<l<<" ";
                mpp[nums[l]].first--;
                if(mpp[nums[l]].first == 0) mpp.erase(nums[l]);
                l++;
            }
            count+= r-l+1;
            // if(mpp.size()==k){
            //     int minIndex = getMinimumLatestIndex(mpp);
            //     count+= minIndex+1;
            //     cout<<"minIndex="<<minIndex<<" increse="<<minIndex+1<<" count="<<count<<endl;
            // }
        }
        return count;
    }
    int subarraysWithKDistinct(vector<int>& nums, int k) {
        return kandmoredistinct(nums,k) - kandmoredistinct(nums,k-1);
    }
};
61240