You are given an integer array nums and an integer k. Your task is to return the number of good subarrays of nums.

A good subarray is a contiguous subarray that contains exactly k distinct integers. For example, in the array $[1, 2, 3, 1, 2]$, the subarray $[1, 2, 3]$contains $3$ distinct integers: $1$, $2$, and $3$.

Constraints:

• $1 \leq$ nums.length $\leq 2 * 10^{4}$

• $1 \leq$ nums[i], k $\leq$ nums.length

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 on how to solve this problem.

Implement your solution in the following coding playground.