find-the-maximum-length-of-valid-subsequence-ii

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> and a positive integer <code>k</code>.
A subsequence <code>sub</code> of <code>nums</code> with length <code>x</code> is called valid if it satisfies:

<ul>
	<li><code>(sub[0] + sub[1]) % k == (sub[1] + sub[2]) % k == ... == (sub[x - 2] + sub[x - 1]) % k.</code></li>
</ul>
Return the length of the longest valid subsequence of <code>nums</code>.
&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,2,3,4,5], k = 2

Output: 5

Explanation:

The longest valid subsequence is <code>[1, 2, 3, 4, 5]</code>.
</div>

Example 2:

<div class="example-block">
Input: nums = [1,4,2,3,1,4], k = 3

Output: 4

Explanation:

The longest valid subsequence is <code>[1, 4, 1, 4]</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 103</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 107</code></li>
	<li><code>1 &lt;= k &lt;= 103</code></li>
</ul>