Given an integer array nums and an integer k, return the total number of good subarrays of nums.

A subarray is defined as good if there are at least $k$ pairs of indices $(i, j)$ such that $i < j$ and nums[i] is equal to nums[j].

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

Constraints:

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

• $1 \leq$ nums[i], k $\leq 10^9$

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.