Given an array A of size N, the task is to find the longest subsequence such that difference between adjacents is one.
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[ ].
For each testcase, in a new line, print the length of the longest subsequence such that difference between adjacents is one.
1<= T <=100
1<= N <=103
1<= A[ ] <=103
10 9 4 5 4 8 6
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.