Word Frequency Counter

Hash Table Easy 0 views

Like0

Given a list of strings words, return a map where each word is associated with how many times it appears.

This is a direct frequency-counting problem using a hash map. For each word, increment its count.

Return all words with their counts.

Example 1:

Input: words = ["apple","banana","apple"]
Output: {"apple":2,"banana":1}

Example 2:

Input: words = ["a","a","a"]
Output: {"a":3}

Example 3:

Input: words = []
Output: {}

Algorithm Flow

Recommendation Algorithm Flow for Word Frequency Counter - Budibadu

Best Answers

java

import java.util.*;
class Solution {
    public Map<String, Integer> word_frequency_counter(String[] words) {
        Map<String, Integer> freq = new HashMap<>();
        for (String w : words) freq.put(w, freq.getOrDefault(w, 0) + 1);
        return freq;
    }
}

javascript

function word_frequency_counter(words) {
    const freq = {};
    for (let i = 0; i < words.length; i++) {
        const w = words[i];
        freq[w] = (freq[w] || 0) + 1;
    }
    return freq;
}

php

<?php
function word_frequency_counter($words) {
    $freq = [];
    foreach ($words as $w) {
        $freq[$w] = ($freq[$w] ?? 0) + 1;
    }
    return $freq;
}
?>

python

from typing import List, Dict

def word_frequency_counter(words: List[str]) -> Dict[str, int]:
    freq = {}
    for w in words:
        freq[w] = freq.get(w, 0) + 1
    return freq

rust

use std::collections::HashMap;
fn word_frequency_counter(words: Vec<String>) -> HashMap<String, i32> {
    let mut freq: HashMap<String, i32> = HashMap::new();
    for w in words {
        *freq.entry(w).or_insert(0) += 1;
    }
    freq
}

typescript

function word_frequency_counter(words: string[]): { [key: string]: number } {
    var freq: { [key: string]: number } = {};
    for (var i = 0; i < words.length; i++) {
        var w = words[i];
        freq[w] = (freq[w] || 0) + 1;
    }
    return freq;
}

Comments (0)

Join the Discussion

Share your thoughts, ask questions, or help others with this problem.

Word Frequency Counter

Algorithm Flow

Best Answers

Solutions Coming Soon

Related Hash Table Problems

Duplicate Indices Map

First Unique Character

Contains Duplicate

Valid Anagram

Ransom Note

Two Sum Indices

Comments (0)

Join the Discussion