BETA

Difficulty Level: Easy

Submissions: 2719 Accuracy:

28.06%

Sorted subsequence of size 3 (Function Problem)
     

Given an array A of N integers, Your task is to complete the function find3Numbers which finds any 3 elements in it such that A[i] < A[j] < A[k] and i < j < k. You need to return them as a vector, if no such element is present then return the empty vector of size 0.

Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the size of the array A in the next line are N space separated values of the array A.

Output:
For each test case in a new line output will be 1 if the sub-sequence returned by the function is present in array A else 0.

Constraints:
1<=T<=100
1<=N<=100
1<=A[ ] <=1000

Example:
Input:

2
5
1 2 1 1 3
3
1 1 3
Output:
1
0

Explanation:
There are 2 test cases

For first test case
a sub-sequence 1 2 3 exist 
For second test case
no such sub-sequence exist

Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harshit Sidhwa


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.