1
class Solution:
2
    def appealSum(self, s: str) -> int:
3
        res, n, prev = 0, len(s), defaultdict(lambda: -1)
4
        for i, ch in enumerate(s):
5
            res += (i - prev[ch]) * (n - i)
6
            prev[ch] = i
7
        return res