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

An equal subarray is defined as a contiguous sequence of elements within an array where every element is identical.

You may delete at most k elements from nums. Return the length of the longest possible equal subarray after performing these deletions.

Constraints:

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

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

• $0 \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.