Google Applied CS - Day 1

Day 1:

Anagram (HashSet, HashMap and ArrayList) and Scarne's dice

Transcript

1. GOOGLE'S APPLIED CS WITH ANDROID DAY 1
2. ANAGRAMS
3. WHAT IS AN ANAGRAM? An anagram is a word formed by rearranging the letters of another word. — Wikipedia
4. EXAMPLE Cinema is an anagram of iceman.
5. MECHANICS 1. Provide user a word from the dictionary. 2. The user tries to create as many words as possible that contain all the letters of the given word plus one additional letter. 3. The user can give up and see the words that they did not guess.
6. CATCH The addition of extra letter at the beginning or the end without reordering the other letters is not valid.
7. MEANING If the game picks the word 'ore' as a starter, the user might guess 'rose' or 'zero' but not 'sore'. i.e. 1. rose ✅ 2. s(ore) ❌
8. STARTER CODE
9. ANAGRAMDICTIONARY'S CONSTRUCTOR WHAT IS NEEDED? 1. Word validation 2. Random word selection 3. Get word's anagrams 4. Get words by length (ext)
10. WORD VALIDATION Set<String> wordSet = new HashSet<>(); ACCESS TIME: O(1)
11. RANDOM WORD SELECTION ArrayList<String> wordList = new ArrayList<>(); RANDOM ACCESS TIME: O(1)
12. GET WORD'S ANAGRAMS Map<String, ArrayList<String>> lettersToWord = new HashMap<>(); ACCESS TIME: O(1)
13. GET WORDS BY LENGTH Map<Integer, ArrayList<String>> sizeToWords = new HashMap<>();
14. SCARNE'S DICE
15. RULES 1. if they roll a 1, score no points and lose their turn 2. if they roll a 2 to 6: ▸ add the rolled value to their points ▸ choose to either reroll or keep their score and end their turn
16. STARTER CODE
17. THIS IS IT FOR TODAY
18. ANY DOUBTS?