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 assertRaises

Challenge Task 2 of 2 Am stuck on task 2 Python testing challenge assertIn fail

import unittest

from string_fun import get_anagrams

class AnagramTestCase(unittest.TestCase): def test_empty_string(self): with self.assertRaises(ValueError): get_anagrams("")

tests.py
import unittest

from string_fun import get_anagrams


class AnagramTestCase(unittest.TestCase):
    def test_empty_string(self):
        with self.assertRaises(ValueError):
          get_anagrams('')
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)
        elif len(yarn[0] == 0):
            raise ValueError("Must provide at least two letters")
    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))

3 Answers

Chase Marchione
Chase Marchione
155,055 Points

Hi Fredy,

The challenge asks us to create a new test named test_no_args. We're told that this test, like the test_empty_string test, also uses 'assertRaises(ValueError)', so you'll find that the first two lines of our new test are very similar to the test_empty_string test--the difference is the test name. We are then told to call get_anagrams() without entering any arguments, so instead of passing in an empty string, we'll pass in nothing extra.

It may help to think about the names of our tests: with our test that we called test_empty_string, we pass an empty string to get_anagrams(), and with our test that we call test_no_args(), we pass in no arguments to that method.

import unittest

from string_fun import get_anagrams

class AnagramTestCase(unittest.TestCase):
    def test_empty_string(self):
        with self.assertRaises(ValueError):
          get_anagrams('')

    def test_no_args(self):
        with self.assertRaises(ValueError):
          get_anagrams()

Hope this helps!

Ha tried this but not passing

import unittest from string_fun import get_anagrams class AnagramTestCase(unittest.TestCase): def test_empty_string(self): with self.assertRaises(ValueError): get_anagrams('') def test_no_args(self): with self.assertRaises(ValueError): get_anagrams()

David Heller
David Heller
1,696 Points

I have that answer in

import unittest

from string_fun import get_anagrams


class AnagramTestCase(unittest.TestCase):
    def test_empty_string(self):
        with self.assertRaises(ValueError):
            get_anagrams('')

    def test_no_args(unittest.TestCase):
        with self.assertRaises(ValueError):
            get_anagrams()

but all i get is Oops! It looks like Task 1 is no longer passing. I've restarted the exercise, renetered the answers, but still can't get it to pass.

My answer seems to be correct.