## Unique Letter String

(This question has been seen in the interviews of the following companies: Google, Amazon)

# Unique Letter String

A character is unique in string S if it occurs exactly once in it. For example, in string S = "LETTER", the only unique characters are "L" and "R". Let's define UNIQ(S) as the number of unique characters in string S. For example, UNIQ("LETTER") =  2. Given a string S with only uppercases, calculate the sum of UNIQ(substring) over all non-empty substrings of S. If there are two or more equal substrings at different positions in S, we consider them different. Since the answer can be very large, retrun the answer modulo 10 ^ 9 7.

#### Example 1:

Input: "ABC"
Output: 10
Explanation: All possible substrings are: "A","B","C","AB","BC" and "ABC".
Every substring is composed with only unique letters.
Sum of lengths of all substring is 1 1 1 2 2 3 = 10

#### Example 2:

Input: "ABA"
Output: 8
``````
public int uniqueLetterString(String s) {
int result = 0;
for(char c = 'A';c <= 'Z'; c++){
int tail = 0;
int count = 0;
for(int i=0;i < s.length();i++){
if(s.charAt(i) == c){
count++;
}
while(count == 2){
if(s.charAt(tail++) == c){
count--;
}
}
if(count==1){
result += head - tail + 1;
}
}
result %= 1_000_000_007;
}
return result;
}
``````