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

Conversely, we shouldn't see the word "code" in the list of anagrams for "treehouse". Add a new test named test_not_in_a

Help...its saying ddnt find test_not_in_anagram

tests.py
import unittest

from string_fun import get_anagrams

class AnagramTests(unittest.TestCase):
  def test_in_anagrams(self):
    self.assertIn("house", get_anagrams('Treehouse'))

class AnagramTestCase(unittest.TestCase):
  def test_not_in_anagrams(self):
    with self.assertNotIn(('code', get_anagrams('Treehouse')):
                          get_anagrams('Treehouse')
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))
Simon Leslie
Simon Leslie
23,690 Points

Was there any need to create a new class rather than including the second test in AnagramTests?

1 Answer

thanks simon...i did it with your help