We post one challenging problem here every week. Solution due is 11:59 PM every Friday. We offer awards to two responders. 1. The first one with the right solution. 2. The correct solution with fewest code statements.<\/p>\n\n\n\n
If we get only one correct solution, we will skip the award for the fewest code statements.<\/p>\n\n\n\n
You need to create an account in this club in order to participate in this competition. The solution can use one of these three languages: Java, Python, JavaScript. You can submit your solution to this topic. Make sure your name and email account are in the end of the solution.<\/p>\n\n\n\n
If you want that we indent your code correctly, please submit your code to this challenge along with a screenshot of your code in your IDE or your code file as an attachment. Remember you still need to submit your code as text here. Thanks for your participation.<\/p>\n\n\n\n
Problem: Tom likes playing with words. He keeps a list of 50 words he likes the most. Now he asks the user to input a string. He will use the characters inputted by the user to form the exact words he has in his list. He can only use the characters that the user inputs. The order of the character in the input is not considered. Can you help Tom write an method to figure out how many words that the input string can form? If the string can form the same words multiple time, count them multiple times. If the word needs three but the input has only one, for an example, that does not count. If it cannot form any word in Tom’s list, return 0. Also please help Tom create his lovely 50 words (no word is just one character, like a for an example) list. All words are Case sensitive<\/strong> <\/p>\n","protected":false},"excerpt":{"rendered":" We post one challenging problem here every week. Solution due is 11:59 PM every Friday. We offer awards to two…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[1],"tags":[],"class_list":["post-171","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/posts\/171","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/comments?post=171"}],"version-history":[{"count":5,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/posts\/171\/revisions"}],"predecessor-version":[{"id":178,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/posts\/171\/revisions\/178"}],"wp:attachment":[{"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/media?parent=171"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/categories?post=171"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/tags?post=171"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}