3016. Minimum Number of Pushes to Type Word II

import java.util.*;

class Solution {
    public int minimumPushes(String word) {
        int[] freq = new int[26];
        for (char c : word.toCharArray()) {
            freq[c - 'a']++;
        }
        
        Integer[] idx = new Integer[26];
        for (int i = 0; i < 26; i++) idx[i] = i;
        Arrays.sort(idx, (a, b) -> freq[b] - freq[a]);
        
        int totalPushes = 0;
        for (int i = 0; i < 26; i++) {
            if (freq[idx[i]] == 0) break;
            int pushCount = (i / 8) + 1;
            totalPushes += pushCount * freq[idx[i]];
        }
        
        return totalPushes;
    }
}

class Solution:
    def minimumPushes(self, word: str) -> int:
        freq = [0] * 26

        for ch in word:
            freq[ord(ch) - ord('a')] += 1

        freq.sort(reverse=True)

        ans = 0
        for i in range(26):
            if freq[i] == 0:
                break
            ans += (i // 8 + 1) * freq[i]

        return ans

class Solution {
public:
    int minimumPushes(string word) {
        vector<int> freq(26, 0);

        for (char c : word)
            freq[c - 'a']++;

        sort(freq.rbegin(), freq.rend());

        int ans = 0;

        for (int i = 0; i < 26; i++) {
            if (freq[i] == 0) break;
            ans += (i / 8 + 1) * freq[i];
        }

        return ans;
    }
};

var minimumPushes = function(word) {
    const freq = new Array(26).fill(0);

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

    freq.sort((a, b) => b - a);

    let ans = 0;

    for (let i = 0; i < 26; i++) {
        if (freq[i] === 0) break;
        ans += (Math.floor(i / 8) + 1) * freq[i];
    }

    return ans;
};