Problem

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

Choose a subarray of nums. You may delete at most k elements from inside that chosen subarray. After the deletions, the remaining elements must all be equal.

Return the maximum possible length of the remaining equal subarray.

In other words, for some value x, you want to find a contiguous segment where, after removing up to k non-x elements, all remaining elements are x, and the number of retained elements is as large as possible.

Input Format

• nums: an integer array
• k: a non-negative integer

Output Format

• Return an integer representing the longest equal subarray length achievable after at most k deletions within one chosen subarray.

Constraints

• 1 <= nums.length <= $10^{5}$
• 1 <= nums[i] <= $10^{5}$
• 0 <= k <= nums.length

Hints

• Think about fixing the value that should remain after deletions.
• For each value, track the positions where it appears.
• The number of elements to delete inside a window of occurrences can be inferred from the gap between their positions and how many equal elements are inside the window.