Minimum Number of Pushes to Type Word II

class Solution {
public:
    int minimumPushes(string word) {
        int cnt[26] = {0};
        for (char c : word) ++cnt[c - 'a'];
        vector<int> v(cnt, cnt + 26);
        sort(v.rbegin(), v.rend());
        int ans = 0;
        for (int i = 0; i < 26; ++i) ans += v[i] * (i / 8 + 1);
        return ans;
    }
};

func minimumPushes(word string) int {
    cnt := [26]int{}
    for i := 0; i < len(word); i++ {
        cnt[word[i]-'a']++
    }
    v := cnt[:]
    sort.Sort(sort.Reverse(sort.IntSlice(v)))
    ans := 0
    for i := 0; i < 26; i++ {
        ans += v[i] * (i/8 + 1)
    }
    return ans
}

from collections import Counter

class Solution:
    def minimumPushes(self, word: str) -> int:
        cnt = Counter(word)
        v = sorted(cnt.values(), reverse=True)
        ans = 0
        for i, c in enumerate(v):
            ans += c * (i // 8 + 1)
        return ans

function minimumPushes(word) {
    const cnt = new Array(26).fill(0);
    for (let i = 0; i < word.length; i++) cnt[word.charCodeAt(i) - 97]++;
    cnt.sort((a, b) => b - a);
    let ans = 0;
    for (let i = 0; i < 26; i++) ans += cnt[i] * (Math.floor(i / 8) + 1);
    return ans;
}

class Solution {
    public int minimumPushes(String word) {
        int[] cnt = new int[26];
        for (int i = 0; i < word.length(); i++) cnt[word.charAt(i) - 'a']++;
        Integer[] v = new Integer[26];
        for (int i = 0; i < 26; i++) v[i] = cnt[i];
        Arrays.sort(v, (a, b) -> b - a);
        int ans = 0;
        for (int i = 0; i < 26; i++) ans += v[i] * (i / 8 + 1);
        return ans;
    }
}

function minimumPushes(word: string): number {
    const cnt: number[] = new Array(26).fill(0);
    for (let i = 0; i < word.length; i++) cnt[word.charCodeAt(i) - 97]++;
    cnt.sort((a, b) => b - a);
    let ans = 0;
    for (let i = 0; i < 26; i++) ans += cnt[i] * (Math.floor(i / 8) + 1);
    return ans;
}