Find the Longest Equal Subarray

Given an array and at most k deletions, find the maximum length of a contiguous subarray that can be made constant (all equal) after removing ≤k elements — equivalently, for some value v find the longest window where at most k elements differ from v. This reduces to testing candidate values and using a sliding-window/counting strategy to maximize the equal-run length.