anonymous
  • anonymous
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!
MIT 6.00 Intro Computer Science (OCW)
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
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.
anonymous
  • anonymous
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!
anonymous
  • anonymous
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)

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
I like your blog site idea, not necessarily spamming it, but the organization behind it.
anonymous
  • anonymous
Thanks man, i wouldn't have understood ps2 problem 3 without that.

Looking for something else?

Not the answer you are looking for? Search for more explanations.