LeetCode: Sum Of Beauty Of All Substrings Solution

Approach

Brute-force

Implementation

1/**
2 * @param {string} s
3 * @return {number}
4 */
5var beautySum = function (s) {
6  const N = s.length
7  let sum = 0
8  for (let i = 0; i < N; i++) {
9    const frequency = Array(26).fill(0)
10    for (let j = i; j < N; j++) {
11      frequency[s[j].charCodeAt(0) - "a".charCodeAt(0)]++
12      sum +=
13        Math.max.apply(null, frequency) -
14        Math.min.apply(null, frequency.filter(Boolean))
15    }
16  }
17  return sum
18}