Branches - Sara & Farah

lib/adagrams.rb

@@ -0,0 +1,170 @@
+# Adagrams - Week 2 - Ada Cohort 12
+# Authors: Sara Baig & Farah Davoodi
+# Date : August 14 2019
+
+# Wave 1 Problem
+require 'csv'
+require 'pry'
+
+def draw_letters ()
+    alphabet = 
+    {
+        '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,
+        'x'=> 1,
+        'y'=> 2,
+        'z'=> 1 }
+
+        all_letters= []
+
+        alphabet.each do |letter, quantity|
+            letters = []
+            i = 0
+            while i < quantity
+                letters << letter
+                i += 1
+            end
+            all_letters << letters
+        end
+
+        all_letters = all_letters.flatten
+
+        all_letters.shuffle!
+        your_letters = []
+        i = 0
+        while i < 10
+            your_letters << all_letters[i]
+            i += 1
+        end
+
+        return your_letters
+    end
+
+
+    # Wave 2 Problem
+    def uses_available_letters?(input, letters_in_hand)
+        word = input.downcase.split('')
+        letters_in_hand = letters_in_hand.join('').downcase.split('')
+        same_letters = letters_in_hand.shuffle
+
+        word.each do |letter|
+            if same_letters.include?(letter)
+                letter_location = same_letters.index(letter)
+                same_letters.delete_at(letter_location)
+            else
+                return false
+            end                
+
+        end
+        return true
+    end
+
+    # Wave 3 Problem
+    def score_word(word)
+        user_word = word.downcase.split('')
+        total_score = 0
+        user_word.each do |letter|
+            case letter
+            when 'a','e','i','o','u','l','n','r','s','t'
+                total_score += 1
+            when 'd','g'
+                total_score += 2
+            when 'b','c','m','p'
+                total_score += 3
+            when 'f','h','v','w','y'
+                total_score += 4
+            when 'k'
+                total_score += 5
+            when 'j','x'
+                total_score += 8
+            when 'q','z'
+                total_score += 10
+            end
+        end
+        if user_word.length > 6
+            total_score += 8
+        end
+
+        return total_score
+    end
+
+
+    # Wave 4 Problem
+    def highest_score_from(words)
+        winning_word = {}
+
+        winning_word_score = 0
+        winning_word = ""
+        winning_word_letter_count = 0
+
+        score_hash = {}
+
+        words.each do |word|
+            score_hash[word] = score_word(word)
+        end
+
+        max_value = score_hash.values.max
+
+        tie = {}
+
+        score_hash.each do |word, score|
+            if score == max_value
+                tie[word] = score
+            end
+        end
+
+        shortest_word = "xxxxxxxxxx"
+
+        tie.each do |word,score|
+            if word.length == 10
+                winning_word = {
+                    word: word,
+                    score: score
+                }
+                return winning_word
+            elsif word.length < shortest_word.length
+                shortest_word = word
+                winning_word_score = score
+            end
+        end
+
+        winning_word = {
+            word: shortest_word,
+            score: winning_word_score
+        }
+        return winning_word
+
+    end
+
+    # Wave 5 Problem
+    def is_in_english_dict?(input)
+
+        dictionary = (File.read("assets/dictionary-english.csv")).split("\n")
+
+        if dictionary.include?(input)
+            return true
+        else
+            return false
+        end
+    end
+