-
Notifications
You must be signed in to change notification settings - Fork 103
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Zoisite - Valerie V. #78
base: main
Are you sure you want to change the base?
Changes from all commits
664248d
93f5e80
6956b8a
82bcb0a
e3be2ab
484c0cb
a9a4e5e
6b66977
e026f2c
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,15 +1,74 @@ | ||
const LETTER_POOL = {A:9, B:2, C:2, D:4, E:12, F:2, G:3, H:2, I:9, J:1, K:1, | ||
L:4, M:2, N:6, O:8, P:2, Q:1, R:6, S:4, T:6, U:4, V:2, W:2, X:1, Y:2, Z:1}; | ||
|
||
const SCORE_CHART = {A:1, B:3, C:3, D:2, E:1, F:4, G:2, H:4, I:1, J:8, K:5, | ||
L:1, M:3, N:1, O:1, P:3, Q:10, R:1, S:1, T:1, U:1, V:4, W:4, X:8, Y:4, Z:10}; | ||
|
||
export const drawLetters = () => { | ||
// Implement this method for wave 1 | ||
const weightedPool = []; | ||
|
||
for (let [key, value] of Object.entries(LETTER_POOL)) { | ||
weightedPool.push(...Array(value).fill(key)); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I love this method of creating the weighted pool of letters! It's sleek and looks good! |
||
} | ||
|
||
const hand = []; | ||
|
||
while (hand.length < 10) { | ||
const letterIndex = Math.floor(Math.random() * weightedPool.length); | ||
hand.push(weightedPool[letterIndex]); | ||
weightedPool.splice(letterIndex, 1); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Great use of splice here! |
||
} | ||
return hand; | ||
}; | ||
|
||
export const usesAvailableLetters = (input, lettersInHand) => { | ||
// Implement this method for wave 2 | ||
const handCopy = [...lettersInHand]; | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Good idea to use the spread operator to make a shallow copy! |
||
|
||
for (let i = 0; i < input.length; i++) { | ||
if (handCopy.includes(input[i])) { | ||
handCopy.shift(); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. The shift method will always remove the first value from the list, so I don't think it's the best option for this particular method. I would say a splice method would be a better choice in this case! |
||
} else { | ||
return false; | ||
} | ||
} | ||
return true; | ||
}; | ||
|
||
export const scoreWord = (word) => { | ||
// Implement this method for wave 3 | ||
let score = 0; | ||
for (let char of word.toUpperCase()) { | ||
if (char in SCORE_CHART) score += SCORE_CHART[char]; | ||
} | ||
if (word.length >= 7) score += 8; | ||
|
||
return score; | ||
}; | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. This looks great! No notes! |
||
|
||
export const highestScoreFrom = (words) => { | ||
// Implement this method for wave 4 | ||
let highestScore = 0; | ||
let topPlayers; | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Since we are returning an object at the end, we could make this an object to begin with! |
||
|
||
for (let word of words) { | ||
let wordScore = scoreWord(word); | ||
if (wordScore > highestScore) { | ||
highestScore = wordScore; | ||
topPlayers = [{word: word, score: wordScore}]; | ||
} | ||
else if (wordScore == topPlayers[0]['score']) { | ||
topPlayers.push({word: word, score: wordScore}); | ||
} | ||
} | ||
|
||
let winner = topPlayers[0] | ||
for (let player of topPlayers) { | ||
if (player['word'].length == 10) { | ||
winner = player; | ||
return winner; | ||
} | ||
if (player['word'].length < winner['word'].length) { | ||
winner = player; | ||
} | ||
} | ||
return winner; | ||
}; | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. This looks good! Well done, Valerie! |
||
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Great job using upper case snake case for your global constants!