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.
Input:
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.
Output:
Number of possible triangles are displayed to the user.
Constraints:
1 <= T <= 200
3 <= N <= 107
1 <= arr[i] <= 103
Example:
Input:
2
3
3 5 4
5
6 4 9 7 8
Output:
1
10
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.
bruceewayne | 175 |
manvirag982 | 158 |
Core_Ka_Bachha | 137 |
yash_sharan | 136 |
rajupraaa1234 | 133 |
mr_kksparrow | 433 |
manvirag982 | 374 |
rajupraaa1234 | 268 |
Exception_404 | 254 |
PranathiBhuvanagiri | 242 |
blackshadows | 5331 |
Ibrahim Nash | 5219 |
akhayrutdinov | 5111 |
mb1973 | 4929 |
Quandray | 4567 |