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 trialAhsan Lake
7,405 PointsI am getting the expected output but the code challenge is rejecting my code. What am I doing wrong?
I've tested against..
print(type(covers({"floats", "Python"}))) print(covers({"floats", "Python"})) print(covers({"floats", "strings"}))
COURSES = {
"Python Basics": {"Python", "functions", "variables",
"booleans", "integers", "floats",
"arrays", "strings", "exceptions",
"conditions", "input", "loops"},
"Java Basics": {"Java", "strings", "variables",
"input", "exceptions", "integers",
"booleans", "loops"},
"PHP Basics": {"PHP", "variables", "conditions",
"integers", "floats", "strings",
"booleans", "HTML"},
"Ruby Basics": {"Ruby", "strings", "floats",
"integers", "conditions",
"functions", "input"}
}
def covers(topics):
match_list = []
for course in COURSES:
compare = set(COURSES.get(course))
if topics < compare:
match_list += [course]
return match_list
1 Answer
Ahsan Lake
7,405 PointsI found the answer in other questions. After writing this question I found where challenge questions are... It appears the question is looking for a single overlap and not all of them. Subset would require the whole set to be an intersection and intersection only requires one value to return true.