|All-time Popular Problems|
|Delete without head pointer|
|Rotate Array by n elements|
|Reverse array in groups|
|Implement Queue using Linked List|
|Column name from a given column number|
|Element with left side smaller and right side greater|
|Remove duplicate element from sorted Linked List|
|Triplet Sum in Array|
|Reverse an Array|
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<= 100
3 <=N<= 100
1 <=arr[i]<= 1000
3 5 4
6 4 9 7 8