Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g1701_1800.s1781_sum_of_beauty_of_all_substrings.Solution

```
public class Solution
extends Object
```
1781 - Sum of Beauty of All Substrings.
Medium

The beauty of a string is the difference in frequencies between the most frequent and least frequent characters.
- For example, the beauty of "abaacc" is 3 - 1 = 2.
Given a string s, return the sum of beauty of all of its substrings.

Example 1:

Input: s = “aabcb”

Output: 5

Explanation: The substrings with non-zero beauty are [“aab”,“aabc”,“aabcb”,“abcb”,“bcb”], each with beauty equal to 1.

Example 2:

Input: s = “aabcbaa”

Output: 17

Constraints:
- 1 <= s.length <= 500
- s consists of only lowercase English letters.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int beautySum(String s)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- beautySum
```
public int beautySum(String s)
```