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! While you're at it, check out some resources Treehouse students have shared here.

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

Python Python Testing Be Assertive assertIn

Elizabeth McInerney
Elizabeth McInerney
3,175 Points

get_anagrams

As I get to the end of this series of Python courses, I am increasingly finding myself in over my head. I did not understand parts of the previous video, but I think I got enough to take a stab at this. Not enough for it to pass though.

tests.py
import unittest

from string_fun import get_anagrams


class AnagramTests(unittest.TestCase):
    def test_in_anagrams(self):
        self.assertIn(self.get_anagram,'house')
string_fun.py
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[0]) <= 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))

1 Answer

Kenneth Love
STAFF
Kenneth Love
Treehouse Guest Teacher

You have it except for two parts. You need to actually call get_anagrams (and it doesn't belong to self, it's just a standalone function), and your arguments are backwards for assertIn. You're asserting that the first argument is in the second argument.