Selecting Three People

Moderate

0/80

Average time to solve is 25m

Contributed by

0 upvote

Problem statement

There are ‘N’ people standing in a row having heights that may or may not be the same. You have to find the number of ways to select three people with heights in strictly increasing order along with their positions. Formally, the height of first people < the height of second people < the height of third people and the position of first people < the position of second people < the position of third people.

Detailed explanation ( Input/output format, Notes, Images )

Input Format :

The first line contains a single integer ‘T’ representing the number of test cases. 

The first line of each test case will contain a single integer ‘N’, which denotes the number of people in the row.

The second line of each test case will contain ‘N’ integers that denote each particular person’s height in the row.

Output Format :

For each test case, print the number of ways to select three people according to the condition given in the description.

Output for every test case will be printed in a separate line.

Note :

You don’t need to print anything; It has already been taken care of. Just implement the given function.

Constraints :

1 <= T <= 10
3 <= N <= 100
1 <= ARR[i] <= 10 ^ 5

Where 'ARR[i]' denotes the height of the i-th people in the row.

Time limit: 1 sec

Sample Input 1 :

Sample Output 1 :

4
7

Explanation of sample input 1 :

In the first test case, the selection can be made as [1, 2, 3], [1, 2, 4], [1, 3, 4], and [2, 3, 4].

In the second test case, the selection can be made as [3, 4, 5], [3, 4, 6], [3, 5, 6], [3, 4, 5], [3, 4, 6], [3, 5, 6], and [4, 5, 6].

Sample Input 2 :

Sample Output 2 :

0
0
1

Explanation of sample input 2 :

In the first test case, there is no way to select three people with the required conditions.

In the second test case, there is no way to select three people with the required conditions.

In the third test case, the selection can be made as [1, 2, 3].

Console