# Now we have another string p. Your job is to find out # how many unique non-empty substrings of p are present in s. # In particular, your input is the string p and you need to output # the number of ...

# 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 ...