Leaves - Emily Vomacka

.vscode/settings.json

@@ -0,0 +1,2 @@
+{
+}

babel.config.js

@@ -9,6 +9,7 @@ const presets = [
         safari: "11.1",
       },
       useBuiltIns: "usage",
+      corejs: 2,
     },
   ],
 ];

package.json

@@ -31,6 +31,7 @@
     "regenerator-runtime": "^0.12.1"
   },
   "dependencies": {
+    "axios": "^0.19.0",
     "core-js": "^2.6.6",
     "vorpal": "^1.11.4"
   }

src/adagrams.js

@@ -1,8 +1,83 @@
 const Adagrams = {
   drawLetters() {
-    // Implement this method for wave 1
+    const letterPool = ('A'.repeat(10) + 'B'.repeat(2) + 'C'.repeat(2) + 'D'.repeat(4) + 'E'.repeat(12) + 'F'.repeat(2) + 'G'.repeat(3) + 'H'.repeat(2) + 'I'.repeat(9) + 'J' + 'K' + 'L'.repeat(4) + 'M'.repeat(2) + 'N'.repeat(6) + 'O'.repeat(8) + 'P'.repeat(2) + 'Q' + 'R'.repeat(6) + 'S'.repeat(4) + 'T'.repeat(6) + 'U'.repeat(4) + 'V'.repeat(2) + 'W'.repeat(2) + 'X' + 'Y'.repeat(2) + 'Z').split('');
+
+    const letterHandIndices = [];
+    do {
+      let newIndex = Math.floor(Math.random() * letterPool.length);
+      if (!letterHandIndices.includes(newIndex)) {
+      letterHandIndices.push(newIndex) }
+    }
+    while (letterHandIndices.length < 10);
+
+    const letterHand = [];
+
+    letterHandIndices.forEach( function(index) {
+    letterHand.push(letterPool[index]) 
+    });
+    return letterHand 
+  },
+
+  usesAvailableLetters(input, lettersInHand) {
+    const lettersInHandCopy = Array.from(lettersInHand);
+    const inputArray = input.split('');
+    let validHand = true
+    inputArray.forEach( function(char) {
+      if (lettersInHandCopy.includes(char)) {
+        lettersInHandCopy.splice(lettersInHandCopy.indexOf(char), 1)
+      } else { validHand = false; 
+      }  
+    });
+  return validHand
+  },
+
+  highestScoreFrom(words) {
+    let wordStats = words.map(x => ( { word: x, score: this.scoreWord(x) } ));
+
+    wordStats.sort(function (a, b) { 
+      return b.score - a.score;
+    });
+
+    let bestWord = wordStats[0];
+
+    for (const element of wordStats) { 
+      if (element.score === bestWord.score && element.word.length === 10) {
+        return element
+      } else if (element.score === bestWord.score && element.word.length <      bestWord.word.length) {
+          bestWord = element
+        }
+    }
+    return bestWord
   },
-};
+
+  scoreWord(word) {
+    const scores = {
+    "AEIOULNRST": 1,
+    "DG": 2,
+    "BCMP": 3,
+    "FHVWY": 4,
+    "K": 5,
+    "JX": 8,
+    "QZ": 10
+    } 
+    const wordArray = word.toUpperCase().split('');
+    let wordScore = 0;
+
+    wordArray.forEach( function(char) {
+      for (const key in scores) {
+        if (key.includes(char)) {
+          wordScore += scores[key];
+        }
+      }
+    });
+    if (wordArray.length > 6) {
+      wordScore += 8;
+    }
+
+    return wordScore
+    }
+}
 
 // Do not remove this line or your tests will break!
 export default Adagrams;
+

test/adagrams.test.js

@@ -84,7 +84,7 @@ describe('Adagrams', () => {
     });
   });
 
-  describe.skip('highestScoreFrom', () => {
+  describe('highestScoreFrom', () => {
     it('returns a hash that contains the word and score of best word in an array', () => {
       const words = ['X', 'XX', 'XXX', 'XXXX'];
       const correct = { word: 'XXXX', score: Adagrams.scoreWord('XXXX') };