Skip to content

Ev Montgomery - Cheetahs - S18 #131

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

Open
wants to merge 3 commits into
base: main
Choose a base branch
from

Conversation

evelynburrito
Copy link

No description provided.

Copy link

@nancy-harris nancy-harris left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Great job! See comments below for comments to make things cleaner/simpler. Also, one of the functions does not do what it is supposed to do.

For commits, make sure to commit more often and make your commits more descriptive! Instead of taking about what wave was completed, include details about what functionality was added.

Comment on lines +123 to +124
expectScores({
'': 0

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Excellent!

@@ -145,7 +147,7 @@ describe("Adagrams", () => {
const words = ["XXX", "XXXX", "X", "XX"];
const correct = { word: "XXXX", score: scoreWord("XXXX") };

throw "Complete test by adding an assertion";
expect(highestScoreFrom(words)).toEqual(correct);

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Excellent!

Comment on lines +8 to +52
const letterPool = {
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 makePoolArr = function() {
const poolArr = [];
for (const [letter, quantity] of Object.entries(letterPool)) {
for (let i = 0; i < quantity; i++) {
poolArr.push(letter);
}
}

return poolArr
};

const getRandNum = function(poolArr) {
const maxLength = poolArr.length - 1;
const randNum = Math.floor(Math.random() * maxLength);
return randNum
};

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

All of this can be done outside of the function. That way it doesn't all have to be re-created every time the drawLetters function is called. Great use of helper functions though!

Comment on lines +60 to +62
const letterValue = function () {
return poolArr[randNum];
}

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

There's no need for a function. Instead, you can just do hand.push(poolArr[randNum]).

for(let letter of input) {
let index = lettersInHand.indexOf(letter);
if(lettersInHand.includes(letter)){
lettersInHand.splice(index, 1);

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

We do not want to modify the lettersInHand array. We should be making a copy of it at the beginning. If the user's hand loses letters every time we're just checking to see if the input has the correct letters, the user will be out of letters quickly.

};

export const scoreWord = (word) => {
// Implement this method for wave 3
const scoreChart = {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Again, this can be declared outside of the function so it doesn't have to be recreated every time the function is called.

Comment on lines +123 to +140
let score = 0
//console.log(score)
//console.log('word:', word)
if(word === "") {
return score
};

for(let letter of word.toUpperCase()) {
//console.log(letter)
score += scoreChart[letter];
//console.log(score)
}

if(word.length > 6){
score += 8;
}

return score

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Excellent!

score += 8;
}

return score
};

export const highestScoreFrom = (words) => {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Great start! This gets us to the correct answer, but requires going through the list of words multiple times. There is a way to just go through the list once. This requires having an object that keeps track of the current highest-scoring word and checking it against the next word to see if it should be replaced until you make it through the whole list.

Comment on lines +160 to 179
const max_score = Math.max(...scores);
//console.log(max_score)

const indices = [];
for(let i = 0; i < scores.length; i++){
if (scores[i] === max_score){
indices.push(i);
}
};
//console.log(indices)

const possibleAnswers = [];
if(indices.length === 1){
return wordsAndScores[indices[0]]
} else {
for(let index of indices){
possibleAnswers.push(wordsAndScores[index])
};
//console.log(possibleAnswers)
};

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Careful with indentation! It's not required to make Javascript work like in Python, but should still be done to make things easier to read.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants