Given an array A of N elements. The task is to complete the function which returns true if triplets exists in array A whose sum is zero else returns false.
The first line of input contains an integer T, denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N, denoting the number of elements in array. The second line of each test case contains N space separated values of the array.
For each test case, output will be 1 if triplet exists else 0.
Your task is to only complete the function to find triplets.
1 <= T <= 100
1 <= N <= 103
-103 <= A <= 103
0 -1 2 -3 1
1 2 3