Anagram Count in Map | Dataford Interview Questions

Find how many strings in a map are anagrams of a given string.

Count only the map's string keys, ignore their associated values, and treat matching as case-sensitive with every character, including spaces, significant. Implement count_anagram_strings(strings_map, target), where strings_map is a dictionary of string keys and arbitrary values, and return an integer count.

Constraints

0 <= len(strings_map) <= 5000
0 <= len(target) <= 1000
Every map key is a string
Map values may be any type and must be ignored
Matching is case-sensitive
All characters, including spaces and punctuation, are significant

Function Signature

def count_anagram_strings(strings_map, target):

Your question is Anagram Count in Map. 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

Find how many strings in a map are anagrams of a given string.

Constraints

0 <= len(strings_map) <= 5000
0 <= len(target) <= 1000
Every map key is a string
Map values may be any type and must be ignored
Matching is case-sensitive
All characters, including spaces and punctuation, are significant

Function Signature

def count_anagram_strings(strings_map, target):

Your question is Anagram Count in Map. 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.