Longest Good Subarray

You have an array called "nums" and an integer "k".

Your task is to find and print the length of the longest contiguous subarray in "nums" where each element occurs at most "k" times.