Скачать или смотреть LeetCode 3110 - Score of a String | JavaScript Solution | DSA Series Day 18

In this problem, we are given a string s made up of lowercase English letters.
The task is to calculate the score of the string.

The score is defined as the sum of the absolute differences between the ASCII values of every pair of consecutive characters in the string.

Problem Breakdown:

Traverse the string from the first character to the second-last character.

For each position i, take the ASCII value of s[i] and s[i+1].

Find their absolute difference.

Keep adding these differences to a running total.

After processing all adjacent pairs, the total will be the final score.

Constraints:

2 ≤ s.length ≤ 100

The string consists only of lowercase English letters ('a' to 'z').

Key Insight:

If two consecutive characters are the same, they add 0 to the score.

Larger alphabetical differences (like 'a' and 'z') contribute more to the score.

This problem is a simple string traversal combined with ASCII value operations.