BETA

Difficulty Level:

Easy

Total Submissions: 336 Accuracy:

38.1%

Longest subsequence-1
     

Given an array A of size N, the task is to find the longest subsequence such that difference between adjacents is one.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the size of array A.

The second line of each test case contains N space separated integers denoting elements of the array A[ ].

Output:
Print the length of the longest subsequence such that difference between adjacents is one. Print the answer for each test case in a new line.

Constraints:
1<= T <=100
1<= N <=1000
1<= A[ ] <=1000

Example:
Input:
1
7
10 9 4 5 4 8 6
Output:
3

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.