Sum of length
Submissions: 661   Accuracy:

37.33%

  Difficulty: Easy   Marks: 2

Given an array. Write a program to calculate the sum of lengths of contiguous subarrays having all distinct elements.

Input:
First line of input contains a single integer T which denotes the number of test cases. Then T test cases follows. First line of each test case contains a single integer N which denotes the number of elements in the array. Second line of each test case contains N space separated integers.
Output:
For each test case, print the sum of lengths of contiguous subarrays having all distinct elements.

Constraints:
1<=T<=100
1<=N<=105

Example:
Input:

3
3
1 2 3
3
1 2 1
4
1 2 3 4
Output:
10
7
20

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harsh Agarwal
Author: harsh.agarwal0


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.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.