Skip to content

Latest commit

 

History

History
26 lines (17 loc) · 905 Bytes

15-Where-my-anagrams-at?.md

File metadata and controls

26 lines (17 loc) · 905 Bytes

Where my anagrams at?

What is an anagram? Well, two words are anagrams of each other if they both contain the same letters. For example:

'abba' & 'baab' == true

'abba' & 'bbaa' == true

'abba' & 'abbba' == false

'abba' & 'abca' == false

Write a function that will find all the anagrams of a word from a list. You will be given two inputs a word and an array with words. You should return an array of all the anagrams or an empty array if there are none. For example:

anagrams('abba', ['aabb', 'abcd', 'bbaa', 'dada']) => ['aabb', 'bbaa']

anagrams('racer', ['crazer', 'carer', 'racar', 'caers', 'racer']) => ['carer', 'racer']

anagrams('laser', ['lazing', 'lazy',  'lacer']) => []

Solution

from collections import Counter 
def anagrams(word, words):
    result = list(filter(lambda x: (Counter(word) == Counter(x)), words)) 
    return result