diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index 2fcd81e6e..7a0df3058 100644
--- a/starter-code/src/functions-and-arrays.js
+++ b/starter-code/src/functions-and-arrays.js
@@ -1,4 +1,7 @@
 // Find the maximum
+function maxOfTwoNumbers (arg1, arg2) {
+  return Math.max(arg1, arg2);
+} 
 
 // Finding Longest Word
 var words = [
@@ -11,14 +14,67 @@ var words = [
   'crackpot'
 ];
 
+function findLongestWord(arr) {
+  let longestWord = arr[0];
+  for (let i=1; i < arr.length; i++) {
+    if (arr[i].length > longestWord.length) {
+      longestWord = arr[i];
+    }
+  }
+  return longestWord;
+}
+findLongestWord(words);
+
 // Calculating a Sum
 
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
+function sumArray(arr) {
+  let total = 0;
+    for (i=0; i<arr.length; i++) {
+      total += arr[i];
+    }
+    return total;
+}
+sumArray(numbers);
+
 // Calculate the Average
 
 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+function averageNumbers(arr) {
+  let total = 0;
+    for (i=0; i<arr.length; i++) {
+      total += arr[i];
+    }
+    return total / arr.length;
+}
+averageNumbers(numbersAvg);
+
+// Calculate the Average Part Deux
+var words = [
+  'seat',
+  'correspond',
+  'linen',
+  'motif',
+  'hole',
+  'smell',
+  'smart',
+  'chaos',
+  'fuel',
+  'palace'
+];
+
+function averageWordLength(arr) {
+  let arrayWordLength = [];
+  for (i=0; i<arr.length; i++) {
+    arrayWordLength.unshift(arr[i].length);
+  }
+  console.log(arrayWordLength);
+  return averageNumbers(arrayWordLength);
+}
+averageWordLength(words);
+
 // Array of Strings
 var wordsArr = [
   'seat',
@@ -48,6 +104,16 @@ var wordsUnique = [
   'bring'
 ];
 
+function uniquifyArray(arr) {
+  let uniqueArr = [];
+  for (let i=0; i<arr.length; i++) {
+    if (uniqueArr.indexOf(arr[i]) === -1) {
+      uniqueArr.push(arr[i]);
+    }
+  }
+}
+uniquifyArray(wordsUnique);
+
 // Finding Elements
 var wordsFind = [
   'machine',
@@ -60,6 +126,18 @@ var wordsFind = [
   'disobedience'
 ];
 
+function doesWordExist(arr) {
+  let mysteryWord = "";
+  for (let i=0; i<arr.length; i++) {
+    if (arr === mysteryWord) {
+      return: true;
+    } else {
+      return: false;
+    }
+  }
+}
+doesWordExist(wordsFind);
+
 // Counting Repetion
 var wordsCount = [
   'machine',
@@ -74,8 +152,20 @@ var wordsCount = [
   'disobedience',
   'matter'
 ];
-// Bonus Quest
 
+function howManyTimes() {
+  let mysteryWord = "";
+  let mysteryWordCounter = 0;
+  for (let i=0; i<arr.length; i++) {
+    if (arr === mysteryWord) {
+      mysteryWordCounter += 1;
+    }
+  }
+  return mysteryWordCounter
+}
+howManyTimes(wordsCount);
+
+// Bonus Quest
 var matrix = [
   [8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8],
   [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0],
@@ -97,4 +187,4 @@ var matrix = [
   [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16],
   [20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54],
   [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
-];
+];
\ No newline at end of file