sea turtles - jae c17

src/adagrams-working.js

@@ -0,0 +1,202 @@
+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 letter = Array.from(Object.keys(LETTER_POOL)); 
+const vals = Array.from(Object.values(LETTER_POOL));
+
+const letter_list = [] 
+let i = 0 
+for (i = 0; i < letter.length; i++){
+  let count = 0 
+  letter_list.push(...letter[i].repeat(vals[i]))
+  // while (count != vals[i]){
+  //   letter_list.push(letter[i])
+
+    // count += 1}
+  }; 
+
+const letterScore = {
+    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,
+  };
+
+
+
+// CONSIDER CHANGING DATA STRUCTURE TO REFLECT ## OF LETTERS (PROBABILITY!)
+// for letterCopy 
+// export const drawLetters = () => {
+//   let letterBank = []
+//   let letterCopy = Object.assign({}, LETTER_POOL)
+//   let i = 0 
+//   let keys = Object.keys(letterCopy)
+//   // let prop = keys[Math.floor(Math.random() * keys.length)]
+//   while (i < 10) {
+//     let prop = keys[Math.floor(Math.random() * keys.length)]
+//     if (letterCopy[prop] > 0){
+//       letterBank[i] = prop;
+//       letterCopy[prop] -= 1;
+
+//       i ++;
+//       }
+//     }
+//     // console.log(letterBank);
+//     return letterBank;
+// };
+
+// console.log(letterBank());
+
+// class Adagrams {
+//   constructure(word, words, input, lettersInHand,){
+//     this.word = word;
+//     this.words = words;
+//     this.input = input;
+//     this.lettersInHand = lettersInHand;
+//   }
+
+
+export const drawLetters = () => {
+  const numbers = new Set();
+  while (numbers.size !== 10) {
+    numbers.add(Math.floor(Math.random() * letter_list.length));
+  }
+  // const numbers = [...set];
+  let hand = [] 
+  for (const num of numbers){
+    hand.push(letter_list[num])
+  }return hand;  
+};
+
+
+
+export const usesAvailableLetters = (input, lettersInHand) => {
+  const handHash = {}; 
+  let hashInput = {};
+  let valid = [] 
+
+  for (const letter of lettersInHand){handHash[letter] = handHash[letter] ? handHash[letter] + 1 : 1;
+  };
+
+  for (const letter of input){
+    if (letter in handHash){
+    hashInput[letter] = hashInput[letter]? hashInput[letter] + 1 : 1;
+    }if (hashInput[letter] <= handHash[letter]){
+      valid.push(letter)
+      }
+  };  
+  return valid.length == input.length; 
+
+  // if  (valid.length == input.length){
+  //   return true;
+  // }else{
+  //   return false;
+  // }
+
+}; 
+
+
+export const wordInfo = (word) => {
+  let wordInfoObj = {}
+  if (word.length == 0){
+    return 0;
+  }
+  const input = word.toUpperCase()
+  let wordHash = {};
+  let counter = word.length > 6 ? 8 : 0;
+
+  for (const letter of input){
+
+    wordHash[letter] = wordHash[letter]? (wordHash[letter] + letterScore[letter])  : letterScore[letter];
+  }
+  for (const key in wordHash) {
+    counter += wordHash[key];
+  }wordInfoObj['word'] = word;
+  wordInfoObj['score'] = counter; 
+  return wordInfoObj; 
+
+};
+
+export const scoreWord = (word) => {
+  if (word.length == 0){
+    return 0;
+  }
+  let results = wordInfo(word); 
+  return results['score']; 
+};
+
+
+export const highestScoreFrom = (words) => {
+  let winningScore = {}
+  let allInfo = []
+  let scores = []
+  let allBest = [] 
+  for (const word of words){
+    if(word.length == 10){
+      return wordInfo(word);
+    }
+      let amnt = scoreWord(word);
+      scores.push(amnt)
+    }
+
+    // find max score & sort words by length 
+  const winner = Math.max(...scores);
+  const word_sort = words.sort((a,b) => a.length - b.length);
+
+  for (const word of word_sort){
+    let word_dict = wordInfo(word); 
+    if (word_dict.score == winner){
+      allBest.push(word_dict)};
+  } return allBest[0]; 
+
+};
+