Sea Turtles JS-Adagrams -Tyrah G.

src/adagrams.js

@@ -1,15 +1,79 @@
+import { SCORE_CHART, LETTER_POOL } from "constants";
+
+//creates letter pool
+export const createLetterPool = () => {
+  let letterPool = [];
+  for (const [key, value] of Object.entries(LETTER_POOL)) {
+    for (let i = 0; i < value; i++) {
+      letterPool.push(key);
+    }
+  }
+  return letterPool;
+};
+
+//shuffles letter pool
 export const drawLetters = () => {
-  // Implement this method for wave 1
+  let letterPool = createLetterPool();
+  let letterPoolDeepCopy = JSON.parse(JSON.stringify(letterPool));
+  function shuffleArray(letterPoolDeepCopy) {
+    for (let i = 0; i < letterPoolDeepCopy; i--) {
+      const j = Math.floor(Math.random() * (i + 1));
+      [array[i], array[j]] = [array[j], array[i]];
+    }
+  }
+  let letterBank = letterPoolDeepCopy.slice(0, 10);
+  return letterBank;
 };
 
 export const usesAvailableLetters = (input, lettersInHand) => {
-  // Implement this method for wave 2
+  for (let letters = 0; letters < input.length; letters++) {
+    let char = input[letters];
+    if (lettersInHand.includes(char) === false) {
+      return false;
+    } else if (lettersInHand.includes(char)) {
+      lettersInHand.splice(char[letters], 1);
+    }
+  }
+  return true;
 };
 
 export const scoreWord = (word) => {
-  // Implement this method for wave 3
+  let score = 0;
+  //iterate through DOG
+  for (let char = 0; char < word.length; char++) {
+    let input = word[char];
+    if (input.toUpperCase() in SCORE_CHART) {
+      score += SCORE_CHART[input.toUpperCase()];
+    }
+  }
+  if (word.length > 6 && word.length < 11) {
+    score += 8;
+  }
+  return score;
 };
 
 export const highestScoreFrom = (words) => {
-  // Implement this method for wave 1
+  let maxScore = 0;
+  let highScoreWord = "";
+
+  for (let word = 0; word < words.length; word++) {
+    let input = words[word];
+    let wordScore = scoreWord(input);
+    if (wordScore > maxScore) {
+      maxScore = wordScore;
+      highScoreWord = input;
+    } else if (wordScore === maxScore) {
+      let wordLen = input.length;
+      let highScoreWordLen = highScoreWord.length;
+      {
+        if (
+          highScoreWordLen !== 10 &&
+          (wordLen === 10 || wordLen < highScoreWordLen)
+        ) {
+          highScoreWord = input;
+        }
+      }
+    }
+  }
+  return { score: maxScore, word: highScoreWord };
 };

src/constants.js

@@ -0,0 +1,57 @@
+export 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,
+};
+
+export 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,
+};

test/adagrams.test.js

@@ -120,7 +120,9 @@ describe("Adagrams", () => {
     });
 
     it("returns a score of 0 if given an empty input", () => {
-      throw "Complete test";
+      expectScores({
+        "": 0,
+      });
     });
 
     it("adds an extra 8 points if word is 7 or more characters long", () => {
@@ -133,7 +135,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: scoreWord("XXXX") };
@@ -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);
     });
 
     describe("in case of tied score", () => {