3498. Reverse Degree of a String

class Solution {
    public int reverseDegree(String s) {
        int result = 0;
        for (int i = 0; i < s.length(); i++) {
            int reversedAlphabetPos = 26 - (s.charAt(i) - 'a');
            int stringPos = i + 1;
            result += reversedAlphabetPos * stringPos;
        }
        return result;
    }
}

class Solution:
    def reverseDegree(self, s):
        result = 0

        for i in range(len(s)):
            reversedAlphabetPos = 26 - (ord(s[i]) - ord('a'))
            stringPos = i + 1

            result += reversedAlphabetPos * stringPos

        return result

class Solution {
public:
    int reverseDegree(string s) {
        int result = 0;

        for (int i = 0; i < s.length(); i++) {
            int reversedAlphabetPos = 26 - (s[i] - 'a');
            int stringPos = i + 1;

            result += reversedAlphabetPos * stringPos;
        }

        return result;
    }
};

class Solution {
    reverseDegree(s) {
        let result = 0;

        for (let i = 0; i < s.length; i++) {
            const reversedAlphabetPos =
                26 - (s.charCodeAt(i) - 'a'.charCodeAt(0));

            const stringPos = i + 1;

            result += reversedAlphabetPos * stringPos;
        }

        return result;
    }
}