1
class Solution:
2
    def beautySum(self, s: str) -> int:
3
        c, n, ans = Counter(s), len(s), 0
4
        for i in range(n - 2):
5
            x = c.copy()
6
            for j in range(n - 1, i + 1, -1):
7
                ans += max(x.values()) - min(x.values())
8
                if x[s[j]] == 1:
9
                    del x[s[j]]
10
                else:
11
                    x[s[j]] -= 1
12
            if c[s[i]] == 1:
13
                del c[s[i]]
14
            else:
15
                c[s[i]] -= 1
16
        return ans