Number of subarrays whose minimum and maximum are same
##### Submissions: 1091   Accuracy: 15.26%   Difficulty: Easy   Marks: 2

Given an array A[] of n integers, the task is to find the number of subarrays whose minimal and maximum elements are same.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of two lines. First line of each test case contains an integer N and the second line contains N space separated array elements.

Output:
For each test case, print the count of required subarrays in new line.

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

1 <= A[i] <= 105

Example:
Input:

2
4
1 2 3 4
3
1 1 3

Output:
4
4

Explanation:

```Input: 1 1 3
Output: 4
Explanation: The subarrays are
(1), (1), (3) and (1, 1)

```

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

Contributor: Arun Tyagi
Author: arun03

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.