The first line of input contains a ‘T’ number of test cases. The second line of each test case contains ‘N’ i.e size of the array. The third line of each test case contains an array ‘ARR[i]’ containing ‘N’ number of values.
For each test case, return the maximum count of triplets indices.
You are not required to print anything explicitly. It has already been taken care of. Just implement the function.
1 <= T <= 5 1 <= N <= 10^3 0 <= i, j, k <= N 1 <= A[i] <= 10^3 Time Limit: 1 sec
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End