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: When you play pool game, you use one ball to hit a group ball and then that group ball is scattered over the pool table. Think about this game using letters. Ask the user to input a variant length string of letters (length is no more than 30 but must be lower case letters). Find the letter that occurs the most times in the string (if more than one letter, using the one that appears before the other one) and use it as the hit ball. You use the hit ball to split the string. Find out how many small groups you have. Also find out the smallest group and the biggest group (Both in number of letters. If multiple, using the one with smaller sum of Unicode values for the smallest and the one with bigger sum of Unicode values for the biggest) . Get the difference of the number of letter in the biggest and the smallest group. Divide this number by the number of the total groups. Print the result out.<\/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-78","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\/78","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=78"}],"version-history":[{"count":2,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/posts\/78\/revisions"}],"predecessor-version":[{"id":100,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/posts\/78\/revisions\/100"}],"wp:attachment":[{"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/media?parent=78"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/categories?post=78"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/icbg.us\/cpc\/wp-json\/wp\/v2\/tags?post=78"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}