From 54958f5bca3751a1e7a588ccf5c8a5b613d8f85f Mon Sep 17 00:00:00 2001 From: Tommy Guy Date: Sun, 9 Nov 2014 17:46:48 -0800 Subject: [PATCH] Update README.md --- README.md | 25 ++++++++++++++++++------- 1 file changed, 18 insertions(+), 7 deletions(-) diff --git a/README.md b/README.md index 3f65169..d68e008 100644 --- a/README.md +++ b/README.md @@ -1,25 +1,36 @@ +This repo contains worked solutions to the problems in the Wordplay section of the Fall Community Data Science Workshop +at the University of Washington, also identified by (https://openhatch.org/wiki/CDSW). - - +Here were the questions: 1) Find all words that start with 'a' and are 9 or more letters long. + 2) What is the longest word that starts with a 'q'? + 3) Find all words that end with 'nge' 4) You need a word to match the phrase "a**e*y". + Are there any words that match? + 5) Print *every other* word that matches the condition in (1) above. + 6) Find the longest string where no character is used > 1 time. Now we're going to start finding points! You can use scrabble.scores to get the scores for every letter. But we're going to cheat: assume you have all the letters. + 7) What is the most valuable word in the dictionary, and how much is it worth? + 8) You want to match a word that starts with an 'a', has an 'e' in the 4th slot, and is no more than 7 characters long. What is the best word you can play? + (*) 9) Make a list that shows the most valuable word that starts with each letter. Example: -a: 37 -b: 47 -c: 41 -d: 36 -..... + + a: apophthegmatize, 37 + c: chiquichiquis, 41 + b: bezzazzes, 47 + e: embezzlements, 37 + d: decitizenizing, 36 + ..... -- 2.30.2