Given an array A of n integers, the task is to find the number of subarrays whose minimal and maximum elements are same.
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.
For each test case, print the count of required subarrays in new line.
1 <= T <= 100
1 <= N <= 105
1 <= A[i] <= 105
1 2 3 4
1 1 3
Input: 1 1 3 Output: 4 Explanation: The subarrays are (1), (1), (3) and (1, 1)
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.