Leetcode Problem 1781. Sum of Beauty of All Substrings

1781. Sum of Beauty of All Substrings

Leetcode Solutions

Initialize a variable total_beauty to store the sum of beauties of all substrings.
Iterate over the string with two nested loops, with the outer loop index i representing the start of the substring and the inner loop index j representing the end of the substring.
For each new starting index i, initialize a frequency array freq of size 26 to 0 (for 26 lowercase English letters).
For each j from i to the end of the string, increment the frequency of the character s[j] in the freq array.
After each increment, calculate the current substring's beauty by finding the maximum and minimum non-zero frequencies in the freq array.
Add the beauty to total_beauty.
After the inner loop ends, move to the next starting index i and repeat steps 3-6.
Return total_beauty as the final result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen