Minimum Number of Pushes to Type Word II solution and explanation

from collections import Counter

def minimum_presses(word):
    frequency = Counter(word)
    sorted_frequencies = sorted(frequency.values(), reverse=True)
    presses = 0
    for i, freq in enumerate(sorted_frequencies):
        presses += ((i // 9) + 1) * freq
    return presses

# Example usage:
word = "abcde"
print(minimum_presses(word))  # Output: 5

function minimumPresses(word) {
    let frequency = {};
    for (let char of word) {
        frequency[char] = (frequency[char] || 0) + 1;
    }
    let frequencies = Object.values(frequency).sort((a, b) => b - a);
    let presses = 0;
    for (let i = 0; i < frequencies.length; i++) {
        presses += Math.floor(i / 9 + 1) * frequencies[i];
    }
    return presses;
}

// Example usage:
const word = "abcde";
console.log(minimumPresses(word));  // Output: 5

import java.util.Arrays;

public class MinimumPresses {
    public static int minimumPushes(String word) {
        int[] frequency = new int[26];
        for (char c : word.toCharArray()) {
            frequency[c - 'a']++;
        }
        Arrays.sort(frequency);
        int presses = 0;
        for (int i = 0; i < 26; i++) {
            if (frequency[25 - i] > 0) {
                presses += ((i / 9) + 1) * frequency[25 - i];
            }
        }
        return presses;
    }

    public static void main(String[] args) {
        String word = "abcde";
        System.out.println(minimumPushes(word));  // Output: 5
    }
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int cmp(const void *a, const void *b) {
    return *(int *)b - *(int *)a;
}

int minimumPushes(char* word) {
    int freq[26] = {0};
    for (int i = 0; word[i] != '\0'; i++) {
        freq[word[i] - 'a']++;
    }
    qsort(freq, 26, sizeof(int), cmp);
    int totalPresses = 0;
    for (int i = 0; i < 26; i++) {
        if (freq[i] > 0) {
            totalPresses += (i / 9 + 1) * freq[i];
        }
    }
    return totalPresses;
}

// Example usage
int main() {
    char word[] = "abcde";
    printf("%d\n", minimumPushes(word));  // Outputs: 5
    return 0;
}

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

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

func minimumPushes(word string) (ans int) {
	cnt := make([]int, 26)
	for _, c := range word {
		cnt[c-'a']++
	}
	sort.Ints(cnt)
	for i := 0; i < 26; i++ {
		ans += (i/8 + 1) * cnt[26-i-1]
	}
	return
}