3838. Weighted Word Mapping Difficulty

class Solution {
    public String mapWordWeights(String[] words, int[] weights) {

        StringBuilder ans = new StringBuilder();

        for (String word : words) {

            long sum = 0;

            for (char ch : word.toCharArray()) {
                sum += weights[ch - 'a'];
            }

            int rem = (int) (sum % 26);

            // Reverse alphabetical mapping:
            // 0 -> 'z', 1 -> 'y', ..., 25 -> 'a'
            char mapped = (char) ('z' - rem);

            ans.append(mapped);
        }

        return ans.toString();
    }
}

class Solution:
    def mapWordWeights(self, words, weights):

        ans = []

        for word in words:

            total = 0

            for ch in word:
                total += weights[ord(ch) - ord('a')]

            rem = total % 26

            ans.append(chr(ord('z') - rem))

        return "".join(ans)

class Solution {
public:
    string mapWordWeights(vector<string>& words,
                          vector<int>& weights) {

        string ans;

        for (string &word : words) {

            long long sum = 0;

            for (char ch : word) {
                sum += weights[ch - 'a'];
            }

            int rem = sum % 26;

            ans.push_back('z' - rem);
        }

        return ans;
    }
};

var mapWordWeights = function(words, weights) {

    let ans = "";

    for (const word of words) {

        let sum = 0;

        for (const ch of word) {
            sum += weights[ch.charCodeAt(0) - 97];
        }

        let rem = sum % 26;

        ans += String.fromCharCode(122 - rem);
    }

    return ans;
};