New update is available. Click here to update.

Last Updated: 19 Mar, 2021

Difficulty: Easy

```
The first line contains an integer 'T' which denotes the number of test cases or queries to be run.
The first line of each test case contains a single integer ‘N’ denoting the size of the array.
The next line contains ‘N’ space-separated strings denoting the values of elements of the given array.
```

```
For each test case, print a single line containing ‘True’ or ‘False’ as per the given condition.
The output of each test case will be printed in a separate line.
```

```
You do not need to print anything; it has already been taken care of. Just implement the function.
```

```
1 <= T <= 5
1 <= N <= 5000
0 <= i < j < k <= N
1 <= ARR[i] <= 10 ^ 9
Where ‘T’ represents the number of test cases and ‘N’ represents the size of array 'i', 'j', 'k' represents the triplets indices, and ‘ARR[i]’ represents the elements of the array.
Time Limit: 1 second .
```

SIMILAR PROBLEMS

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

Maximize

Posted: 9 Dec, 2022

Difficulty: Easy

Negative To The End

Posted: 16 Dec, 2022

Difficulty: Easy

Popular Interview Problems: