You are given an integer array nums and an integer k.

A subarray is called good if the frequency of each element in that subarray is at most k.

Return the length of the longest good subarray of nums.

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] $\leq 10^9$

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

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.