Anagram Counting | Dataford Interview Questions

Vumedi search suggestions may contain several terms formed from the same letters as a target term. Given a lowercase word w and a list of lowercase words words, return how many entries in words are anagrams of w.

Two words are anagrams when they contain exactly the same characters with the same frequencies. Count duplicate entries separately. The comparison is case-sensitive by contract, and every input character is a lowercase English letter.

Formal Specification

Implement count_anagram_words(w, words).

Input: w, a non-empty string, and words, a list of strings.
Output: an integer equal to the number of words in words whose character multiset matches w.
The order of characters does not matter, but word length and repeated characters do.

Constraints

1 <= len(w) <= 10^5
0 <= len(words) <= 10^5
The total number of characters across all words is at most 10^6
Each string contains only lowercase English letters
Duplicate entries in words are counted independently

Function Signature

def count_anagram_words(w, words):

Your question is Anagram Counting. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem