1
class Solution:
2
    def sumScores(self, s):
3
        n = len(s)
4

5
        dp, ans, j = [1] * n, [0] * n, 0
6

7
        for i in range(1, n):
8
            while s[i] != s[j] and j > 0:
9
                j = ans[j - 1]
10

11
            if s[i] == s[j]:
12
                dp[i] += dp[j]
13
                ans[i] = j + 1
14
                j += 1
15

16
        return sum(dp)