Count the number of sub arrays such that each element in the subarray appears at least twice

Question

I have come across a problem and can\'t seem to come up with an efficient solution. The problem is as follows:

Given an array A, count the number of consecutive conti