Split Array Into Increasing Subsequences Problem Statement

You are provided with an integer array ARR of size N sorted in ascending order. Your task is to determine if it is possible to split this array into one or more increasing subsequences such that each subsequence is made up entirely of consecutive integers and has a minimum length of three. If yes, return 1; otherwise, return 0.

Explanation:

An increasing sequence is defined as a sequence where the difference between each subsequent element is exactly 1. For example, sequences like [1, 2, 3, 4], [3, 4, 5], or [-1, 0, 1] are considered increasing subsequences.

Input:

The input consists of:

The first line contains an integer T, the number of test cases.

The first line of each test case contains a single integer N, the number of elements in the array 'ARR'.

The second line of each test case contains N space-separated integers, representing the elements of 'ARR'.

Output:

For each test case, output a single line containing 1 if the array can be split into subsequences where each subsequence comprises consecutive integers with a length of at least 3. Otherwise, output 0.

Example:

Input:
 T = 1
 N = 4
 ARR = [1, 2, 3, 4]

Output:

1

Explanation:

The array [1, 2, 3, 4] can be split into an increasing subsequence of itself, which has a length greater than 3.

Constraints:

• 1 ≤ T ≤ 5
• 1 ≤ N ≤ 5000
• -1250 ≤ ARR[i] ≤ 1250

Note: The function implementation does not require explicit printing of the result; it is managed internally.