diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 000000000..c3df2e669
Binary files /dev/null and b/.DS_Store differ
diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index 2fcd81e6e..7ed123254 100644
--- a/starter-code/src/functions-and-arrays.js
+++ b/starter-code/src/functions-and-arrays.js
@@ -1,5 +1,14 @@
 // Find the maximum
 
+function maxOfTwoNumbers(num1, num2) {
+  if(num1 > num2)
+    return num1;
+  else
+    return num2;
+}
+
+maxOfTwoNumbers(25,22);
+
 // Finding Longest Word
 var words = [
   'mystery',
@@ -10,15 +19,44 @@ var words = [
   'orchard',
   'crackpot'
 ];
+function findLongestWord(words) {
+  if(words.length === 0){
+    return undefined
+  }
+  let longestWord = 0;
+  let longestName = "";
+  for(let i = 0; i < words.length; i++){
+    if(words[i].length > longestWord){
+  longestWord = words[i].length;
+  longestName = words[i];
+     }
+  }
+  
+  return longestName;
+  
+}
 
 // Calculating a Sum
-
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-// Calculate the Average
+function sumArray(arr){
+  let sumNumbers=0;
+  for (i=0; i<arr.length; i++){
+    sumNumbers += arr[i];
+  }
+  
+  return sumNumbers;
+}
 
+// Calculate the Average
 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+function averageNumbers(arr){
+  let sumLength= sumArray(arr);
+  let sumAverage= (sumLength/arr.length);
+  return sumAverage;  
+}
+
 // Array of Strings
 var wordsArr = [
   'seat',
@@ -32,9 +70,23 @@ var wordsArr = [
   'fuel',
   'palace'
 ];
+function averageNumbers(wordsArr){
+  if(wordsArr.length === 0){
+    return undefined
+  }
+  let lengthAverage=0;
+  let averageWordsArr=0;
+  for (i=0; i<wordsArr.length; i++){
+    lengthAverage += wordsArr[i].length; 
+  }
+  averageWordsArr=(lengthAverage/(wordsArr.length));
+
+  return Math.ceil(averageWordsArr);
+}
+
 
 // Unique Arrays
-var wordsUnique = [
+var words = [
   'crab',
   'poison',
   'contagious',
@@ -46,7 +98,20 @@ var wordsUnique = [
   'communion',
   'simple',
   'bring'
-];
+  ];
+  function uniquifyArray(array){
+    if(array.length === 0){
+      return undefined
+    }  
+    let newArray = [];
+      for (let i=0; i<array.length; i++){
+        if(newArray.indexOf(array[i])=== -1){
+          newArray.push(array[i])
+        }
+      }
+    return newArray;
+  }
+
 
 // Finding Elements
 var wordsFind = [
@@ -59,6 +124,16 @@ var wordsFind = [
   'truth',
   'disobedience'
 ];
+let search = ""
+function doesWordExist (array, word) {
+  for (var i = 0 ; i < array.length; i++) {
+    if(word === array[i]) {
+      return true
+    }
+  }
+  return false;
+}
+
 
 // Counting Repetion
 var wordsCount = [
@@ -72,8 +147,25 @@ var wordsCount = [
   'matter',
   'truth',
   'disobedience',
-  'matter'
+  'matter',
 ];
+
+function howManyTimes(array, word){
+  let count = 0;
+  if (array.length === 0){
+    return false;
+  }
+  
+  for (let i=0; i < wordsCount.length; i++){
+    if (word === wordsCount[i]) {
+      count += 1;
+      
+    }
+  }
+  return count;
+}
+
+
 // Bonus Quest
 
 var matrix = [