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 trialJanusz Pachołek
3,334 PointsIs there better solution for this challenge?
I solved challenge with code attached below. I didn't used dictionary packing mentioned in movie before. It also checks every key even if it has been checked already. Is there better, more pythonic way to solve it then?
# E.g. word_count("I do not like it Sam I Am") gets back a dictionary like:
# {'i': 2, 'do': 1, 'it': 1, 'sam': 1, 'like': 1, 'not': 1, 'am': 1}
# Lowercase the string to make it easier.
def word_count(stringy):
words = (stringy.lower()).split()
diction = {}
for x in words:
counter = 0
for i in words:
if i == x:
counter += 1
diction.update({x: counter})
return diction
1 Answer
Jeremiah Bushau
24,061 PointsI would not say that this is a 'better' way but it is another way. Using dictionary comprehension and the count method. Hope this helps give ya some ideas! :) Feel free to let me know if you'd like further explanation.
def word_count(string_arg):
words = string_arg.lower().split()
return { word: words.count(word) for word in words }
Janusz Pachołek
3,334 PointsJanusz Pachołek
3,334 PointsThanks, it's much better than my solution. I just wonder why words that are multiple times in a words list are not counted multiple times? Are they excluded from for loop if they were counted before? I hope I'm clear...