C22 Sphinx Izzy #27
C22 Sphinx Izzy #27
Conversation
| @@ -1,15 +1,107 @@ | |||
| 'use strict'; | |||
|
|
|||
| import { letterPool, scoreChart } from './constants.js'; | |||
| for (const [letter, freq] of Object.entries(letterPoolDict)) { | ||
| for (let i = 0; i < freq; i++) { | ||
| letterPoolList.push(letter); | ||
| } | ||
| } |
There was a problem hiding this comment.
Something extra to think about is how you could implement this same functionality with the ... syntax that is provided and if you think it provides any advantages against what you have.
| const removeLetter = (list, letter) => { | ||
| //Function has two parameters, a list and a letter, and returns a list with the letter removed | ||
| const index = list.indexOf(letter); | ||
| list.splice(index, 1); |
There was a problem hiding this comment.
These are letter counts will the same size but what if they weren't? What if the input size varied? What would be the time complexity of your code? What CS fundamentals data structure did we learn about that is handy for keeping track of the number of occurrences? Is there anything we can cross reference this data structure to?
| //Function has one parameter, a dictionary, and returns a list of letters. | ||
| let letterPoolList = []; | ||
|
|
||
| for (const [letter, freq] of Object.entries(letterPoolDict)) { |
There was a problem hiding this comment.
Nice work finding the javascript version of .items!
| const drawnLetters = []; | ||
| for (let i = 0; i < 10; i++) { | ||
| const randomIndex = getRandomNumber(letterPoolList.length - 1); | ||
| const letter = letterPoolList[randomIndex]; | ||
| drawnLetters.push(letter); | ||
|
|
||
| removeLetter(letterPoolList, letter); | ||
| } |
There was a problem hiding this comment.
Love this functionality, you separate concerns, making your more digestible!
| // Implement this method for wave 2 | ||
| // Function checks if the input word uses available letters in the letterInHand list | ||
| const wordUpperCase = input.toUpperCase(); | ||
| const temporaryLetterBank = [...lettersInHand]; |
| // Function scores the word | ||
| const inputUpperCase = word.toUpperCase(); | ||
| let score = 0; | ||
|
|
||
| for (const letter of inputUpperCase) { | ||
| if (scoreChart[letter]) { | ||
| score += scoreChart[letter]; | ||
| } | ||
| } | ||
| if (inputUpperCase.length >= 7) { | ||
| score += 8; | ||
| } | ||
| return score; | ||
| }; |
| const findHighestScore = (words) => { | ||
| //Function finds the max word score in the list | ||
| const max = words.reduce((prev, current) => { | ||
| if (scoreWord(current) > scoreWord(prev)) { | ||
| return current; | ||
| } else if (scoreWord(current) === scoreWord(prev)) { | ||
| if (current.length === prev.length) { | ||
| return prev; | ||
| } else if (current.length === 10) { | ||
| return current; | ||
| } else if (prev.length === 10) { | ||
| return prev; | ||
| } else if (current.length < prev.length) { | ||
| return current; | ||
| } | ||
| } | ||
| return prev; | ||
| }, words[0]); | ||
|
|
||
| return max; |
There was a problem hiding this comment.
Love to see you using the reduce method, you did good with this! ⭐️
No description provided.