Question

I've done all the work for this course. You can find it at my blog: http://proficiamus.blogspot.com/

Please let me know if there are any problems!

Answer 1

Hey thanks a lot for posting this.
So far, I'm seeing a problem in problem set 6 #4.
with find_all_subsets(sorted(hand)) you're not allowing for duplicate letters because hand is a dictionary and you end up with just a sorting of the keys.

Answer 2

Thanks for the heads up. Fixed.

Detail of the fix:

instead of using sorted(hand), which is a list of all the keys in hand sorted alphabetically, i used the following code to make a better list:

sorted_hand = []
for i in sorted(hand):
sorted_hand += [i] * hand[i]

So, for example, if hand = {'b':1,'a':2}, the code would set i = a, and then add ['a','a'] to sorted_hand. next it would set i = b, and add ['b'] to sorted_hand.

Hope this helps! Thanks again!

Answer 3

Yeah I'm glad I saw it in your code because I have a feeling I would have stepped into the same pothole with the sorted(hand)

Answer 4

I like your blog site idea, not necessarily spamming it, but the organization behind it.

Answer 5

Thanks man, i wouldn't have understood ps2 problem 3 without that.