Given an array of distinct integers. The task is to count all the triplets such that sum of two elements equals the third element.
Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of two lines. First line of each test case contains an Integer N denoting size of array and the second line contains N space separated elements.
Output:
For each test case, print the count of all triplets, in new line. If no such triplets can form, print "-1".
Constraints:
1 <= T <= 100
3 <= N <= 105
1 <= A[i] <= 106
Example:
Input:
2
4
1 5 3 2
3
3 2 7
Output:
2
-1
Explanation:
Testcase 1: There are 2 triplets: 1 + 2 = 3 and 3 +2 = 5
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
mr_kksparrow | 433 |
manvirag982 | 272 |
snow_den_ | 236 |
arpit_anshuman | 228 |
Exception_404 | 220 |
blackshadows | 5331 |
Ibrahim Nash | 5219 |
akhayrutdinov | 5111 |
mb1973 | 4929 |
Quandray | 4567 |