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.
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.
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.
1<=A[ ] <=1000
1 2 1 1 3
1 1 3
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.