New update is available. Click here to update.

Last Updated: 5 Mar, 2021

Difficulty: Moderate

```
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
```

SIMILAR PROBLEMS

Missing Number

Posted: 30 Oct, 2022

Difficulty: Easy

Longest Subarray With Zero Sum

Posted: 3 Nov, 2022

Difficulty: Moderate

Merge Two Sorted Arrays Without Extra Space

Posted: 19 Nov, 2022

Difficulty: Moderate

Ninja And The Strictly Increasing Array

Posted: 27 Nov, 2022

Difficulty: Moderate

Negative To The End

Posted: 16 Dec, 2022

Difficulty: Easy

Popular Interview Problems: