Leet Code Daily 2024-08-06 - Minimum Number of Pushes to Type Word II

class Solution {
public:
    int minimumPushes(string word) {
        vector<int> freq(26, 0);
        for (const auto& c : word) {
            freq[c - 'a']++;
        }
        sort(freq.begin(), freq.end());
        int ret = 0;
        for (int i = 0; i < 26; i++) {
            ret += (i / 8 + 1) * freq[25 - i];
        }
        return ret;
    }
};