Watch 10 video solutions for Sum of Beauty of All Substrings, a medium level problem involving Hash Table, String, Counting. This walkthrough by Striver has 522,271 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
The beauty of a string is the difference in frequencies between the most frequent and least frequent characters.
"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 <= 500s consists of only lowercase English letters.