Question

An anagram of a string is another string with the same characters in the same frequency, In any order. For example 'abc', 'bca', 'acb', 'bac', 'cba', 'cab' are all anagrams of the string 'abc. Given two arrays of strings, for every string in one list, determine how many anagrams of it are in the other list. Write a function that receives dictionary and query, two string arrays. It should return an array of Integers where each element i contains the number of anagrams of query[i] that exist in dictionary.

Answer 1

Answer:

fhhhiiyghkifddchiigy