The beauty of a string is defined as the difference between the maximum frequency and the minimum frequency of any character that appears in that string.

Given a string s, return the total sum of the beauty of all its substrings.

Constraints:

• $1 \leq$ s.length $\leq 500$

• s consists of only 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.