Speed Up the Most Frequent Word

function mostFrequentWord(words) {
  const counts = new Map();
  for (const w of words) counts.set(w, (counts.get(w) ?? 0) + 1);
  let best = null;
  let bestCount = 0;
  for (const [w, c] of counts) {
    if (c > bestCount || (c === bestCount && w < best)) {
      best = w;
      bestCount = c;
    }
  }
  return best;
}

function mostFrequentWord(words: string[]): string {
  const counts = new Map<string, number>();
  for (const w of words) counts.set(w, (counts.get(w) ?? 0) + 1);
  let best = "";
  let bestCount = 0;
  for (const [w, c] of counts) {
    if (c > bestCount || (c === bestCount && w < best)) {
      best = w;
      bestCount = c;
    }
  }
  return best;
}

from collections import Counter

def most_frequent_word(words: list[str]) -> str:
    counts = Counter(words)
    return min(counts, key=lambda w: (-counts[w], w))

<?php

function mostFrequentWord(array $words): string
{
    $counts = [];
    foreach ($words as $w) {
        $counts[$w] = ($counts[$w] ?? 0) + 1;
    }
    $best = '';
    $bestCount = 0;
    foreach ($counts as $w => $c) {
        $w = (string) $w; // numeric-looking keys become ints in PHP arrays
        if ($c > $bestCount || ($c === $bestCount && strcmp($w, $best) < 0)) {
            $best = $w;
            $bestCount = $c;
        }
    }
    return $best;
}

class Solution {
    public String mostFrequentWord(String[] words) {
        Map<String, Integer> counts = new HashMap<>();
        for (String w : words) counts.merge(w, 1, Integer::sum);
        String best = "";
        int bestCount = 0;
        for (Map.Entry<String, Integer> e : counts.entrySet()) {
            int c = e.getValue();
            if (c > bestCount || (c == bestCount && e.getKey().compareTo(best) < 0)) {
                best = e.getKey();
                bestCount = c;
            }
        }
        return best;
    }
}