Given an unsorted array of positive integers. Find the number of triangles that can be formed with three different array elements as lengths of three sides of triangles.
The first line of the input contains T denoting the number of testcases. First line of test case is the length of array N and second line of test case are its elements.
Number of possible triangles are displayed to the user.
1 <= T <= 200
3 <= N <= 107
1 <= arr[i] <= 103
3 5 4
6 4 9 7 8
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.