Find Maximum Length Sub-array with Specific Adjacent Differences

Given an array of integers ‘A’ of length ‘N’, find the maximum length of a sub-array where the absolute difference between adjacent elements is either 0 or 1.

Example:

Input:

A = [2, 4, 6, 7, 6, 9]

Output:

3

Explanation:

The sub-array [6, 7, 6] has adjacent elements with absolute differences of either 0 or 1, and its length is 3, which is the maximum possible.

Input:

T = number of test cases
For each test case:
N = number of elements in the array
Array A with N space-separated integers

Output:

For each test case, output the maximum length of the sub-array as a single integer in a new line.

Constraints:

• 1 <= T <= 50
• 1 <= N <= 10⁴
• -10⁸ <= A[i] <= 10⁸

Time limit: 1 sec.

Note:

No need to print the output; it is handled automatically. Implement the function to output the results.