You are building a string s of length n from right to left, one character at a time. For each $i$ from $1$ to n, let $s_i$ denote the suffix of s of length $i$.

The score of $s_i$ is defined as the length of the longest common prefix between $s_i$ and s.

Return the total sum of the scores across all $s_i$ for $1 \leq i \leq n$.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s consists of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.