#2831
Find the Longest Equal Subarray
expert · 1035 · lc medium +32 · verified · 37.7% accepted · 757 likes · top 16%
Description
A 0-indexed integer array nums and an integer k are given.
A subarray is equal when all its elements are the same. (The empty subarray counts as equal.)
Return the length of the longest equal subarray achievable after removing at most k elements from nums.
A subarray is a contiguous, possibly empty sequence of elements within an array.
Example 1:
Input: nums = [1,3,2,3,1,3], k = 3
Output: 3
Explanation: It's optimal to delete the elements at index 2 and index 4.
After deleting them, nums becomes equal to [1, 3, 3, 3].
The longest equal subarray starts at i = 1 and ends at j = 3 with length equal to 3.
It can be proven that no longer equal subarrays can be created.
Example 2:
Input: nums = [1,1,2,2,1,1], k = 2
Output: 4
Explanation: It's optimal to delete the elements at index 2 and index 3.
After deleting them, nums becomes equal to [1, 1, 1, 1].
The array itself is an equal subarray, so the answer is 4.
It can be proven that no longer equal subarrays can be created.
Code
1
2
3