Package g2801_2900.s2831_find_the_longest_equal_subarray

Class Solution

java.lang.Object
g2801_2900.s2831_find_the_longest_equal_subarray.Solution
public class Solution extends java.lang.Object
2831 - Find the Longest Equal Subarray.

Medium

You are given a 0-indexed integer array nums and an integer k.

A subarray is called equal if all of its elements are equal. Note that the empty subarray is an equal subarray.

Return the length of the longest possible equal subarray after deleting 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.

Constraints:

  • 1 <= nums.length <= 105
  • 1 <= nums[i] <= nums.length
  • 0 <= k <= nums.length

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    longestEqualSubarray(java.util.List<java.lang.Integer> nums, int k)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • longestEqualSubarray

      public int longestEqualSubarray(java.util.List<java.lang.Integer> nums, int k)