Welcome to the Treehouse Community
Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community!
Looking to learn something new?
Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.Start your free trial
MUZ140750 Bhekimpi Sithole2,640 Points
help l am stuck on python testing Challenge Task 1 of 2
i am having problems with this concept
import unittest from string_fun import get_anagrams class AnagramTests(unittest.TestCase): def test_in_anagrams(self): pass
import itertools def is_palindrome(yarn): """Return whether or not a string is a palindrome. A palindrome is a word/phrase that's the same in both directions. """ return yarn == yarn[::-1] def get_anagrams(*yarn): """Return a list of anagrams for a string.""" # If only one letter came in, return it if yarn: if len(yarn) <= 1: return list(yarn) else: raise ValueError("Must provide at least two letters") # Get all of the words from the dictionary words = set([ w.strip().lower() for w in open('words.txt') ]) output = set() for thread in yarn: thread = thread.lower() # Find all possible anagrams for i in range(2, len(thread)): fibers = set( [''.join(w) for w in itertools.permutations(thread, i)] ) output.update(fibers.intersection(words)) # Finally, return all of the combinations that are in the dictionary return sorted(list(output))
You should you the
assertIn() to check if the word 'house' is in 'treehouse' using the provided functions in string_fun.py, if you need any more explanation please just let me know :)