diff --git a/README.md b/README.md
index 5d11b9e6e..81bf62d26 100644
--- a/README.md
+++ b/README.md
@@ -93,7 +93,7 @@ Define a function `maxOfTwoNumbers` that takes two numbers as arguments and retu
 
 ## Finding Longest Word
 
-Write a function `findLongestWord` that takes an array of words and returns the length of the longest one. If there are 2 with the same length, it should return the first occurrence. 
+Write a function `findLongestWord` that takes an array of words and returns the longest one. If there are 2 with the same length, it should return the first occurrence. 
 
 **Starter Code**
 
diff --git a/starter-code/.DS_Store b/starter-code/.DS_Store
new file mode 100644
index 000000000..2de69c45b
Binary files /dev/null and b/starter-code/.DS_Store differ
diff --git a/starter-code/jasmine/.DS_Store b/starter-code/jasmine/.DS_Store
new file mode 100644
index 000000000..f85fcfb0f
Binary files /dev/null and b/starter-code/jasmine/.DS_Store differ
diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index 2fcd81e6e..f29508891 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(number1, number2){
+  if(number1>=number2){return number1;}
+  else {return number2;}
+}
 
 // Finding Longest Word
 var words = [
@@ -11,14 +14,43 @@ var words = [
   'crackpot'
 ];
 
-// Calculating a Sum
+function findLongestWord(words){
+  var lengths=[], max=0;
+  for(var i=0; i<words.length; i++){
+    for(var j=0, count=0; j < words[i].length;j++){
+      count++;
+    }
+      lengths.push(count);
+      if(i===0)max=lengths[i];
+      else if(i===1)max = maxOfTwoNumbers(lengths[i], lengths[i-1]);
+      else max = maxOfTwoNumbers(lengths[i], max);
+  }
+  return words[lengths.indexOf(max)];
+}
 
+// Calculating a Sum
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
+function sumArray(array) {
+  for(var i=0, sum=0; i<array.length; i++ ) {
+    sum += array[i];
+  }
+  return sum;
+}
+
+
+console.log(sumArray(numbers));
+
 // Calculate the Average
 
 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+function averageNumbers(array) {
+  return sumArray(array)/array.length;
+}
+
+console.log(averageNumbers(numbersAvg));
+
 // Array of Strings
 var wordsArr = [
   'seat',
@@ -33,7 +65,19 @@ var wordsArr = [
   'palace'
 ];
 
+function averageWordLength(wordsArray){
+  var lengths=[], max=0;
+  for(var i=0; i<wordsArray.length; i++){
+    for(var j=0, count=0; j < wordsArray[i].length;j++){
+      count++;
+    }
+      lengths.push(count);
+  }
+      return averageNumbers(lengths);
+}
+
 // Unique Arrays
+
 var wordsUnique = [
   'crab',
   'poison',
@@ -48,6 +92,24 @@ var wordsUnique = [
   'bring'
 ];
 
+function uniquifyArray (array) {
+    var newArray=[];
+    for(var i=0; i<array.length; i++){
+      j=i+1;
+      test=false;
+      while(j<array.length){
+        if(array[i]===array[j]) {
+        test=true;
+        break;
+        }
+        j++;
+      }
+      if(test===false) newArray.push(array[i]);
+    }
+    return newArray;
+  }
+
+
 // Finding Elements
 var wordsFind = [
   'machine',
@@ -60,6 +122,15 @@ var wordsFind = [
   'disobedience'
 ];
 
+
+function doesWordExist (array, word) {
+  var string = array.join("--");
+  if(string.includes(word)) return true;
+  else return false;
+  }
+
+
+
 // Counting Repetion
 var wordsCount = [
   'machine',
diff --git a/starter-code/tests/FunctionsAndArraysSpec.js b/starter-code/tests/FunctionsAndArraysSpec.js
index 8fb25ff65..67a3b8bad 100644
--- a/starter-code/tests/FunctionsAndArraysSpec.js
+++ b/starter-code/tests/FunctionsAndArraysSpec.js
@@ -170,7 +170,7 @@ describe('Counting Repetion - howManyTimes', function () {
   });
 
   it('returns false with an empty array', function () {
-    expect(howManyTimes([])).toBe(undefined);
+    expect(howManyTimes([])).toBe(false);
   });
 
   it('returns one when the word appears only one time on the array', function () {