Package g3201_3300.s3202_find_the_maximum_length_of_valid_subsequence_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3202 - Find the Maximum Length of Valid Subsequence II.

    Medium

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

    A subsequence sub of nums with length x is called valid if it satisfies:

    • (sub[0] + sub[1]) % k == (sub[1] + sub[2]) % k == ... == (sub[x - 2] + sub[x - 1]) % k.

    Return the length of the longest valid subsequence of nums.

    Example 1:

    Input: nums = 1,2,3,4,5, k = 2

    Output: 5

    Explanation:

    The longest valid subsequence is [1, 2, 3, 4, 5].

    Example 2:

    Input: nums = 1,4,2,3,1,4, k = 3

    Output: 4

    Explanation:

    The longest valid subsequence is [1, 4, 1, 4].

    Constraints:

    • <code>2 <= nums.length <= 10<sup>3</sup></code>

    • <code>1 <= numsi<= 10<sup>7</sup></code>

    • <code>1 <= k <= 10<sup>3</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maximumLength(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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