diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
index 3a7dbec41..eb3f7b6f5 100644
--- a/src/functions-and-arrays.js
+++ b/src/functions-and-arrays.js
@@ -1,20 +1,45 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
+function maxOfTwoNumbers(num1, num2) {
+  if (num1 > num2){
+    return  num1;
+  } else { return num2 };
+  
+}
 
 
 
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
+function findLongestWord(words) {
+  if (words.length === 0){
+    return null;
+  }
+  if (words.length === 1){
+    return words[0];
+  }
+}
 
 
 
 // Iteration #3: Calculate the sum
+
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
+function sumNumbers(numbers) {
+  let sum = 0;
 
+  if (numbers.length === 0) {
+    return 0;
+  }
+
+  for (let i = 0; i < numbers.length; i++) {
+    if (typeof(numbers[i]) === "number") {
+      sum += numbers[i];
+    }
+    return sum;
+  }
+}
 
 
 // Iteration #3.1 Bonus:
@@ -26,16 +51,49 @@ function sum() {}
 // Level 1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
-function averageNumbers() {}
+function averageNumbers(numbersAvg) {
+  let sum = 0;
+  let average = 0;
+
+  if (numbersAvg.length === 0) {
+    return null;
+  }
 
+  for (let i = 0; i < numbersAvg.length; i++) {
+    sum += numbersAvg[i];
+  }
+  average = sum / numbersAvg.length;
+  return average;
+}
 
 // Level 2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
 
-function averageWordLength() { }
+function averageWordLength(Arr1) {   //2//
+  if (Arr1.length === 0){
+    return null;
+  }
+  for (let i = 0; i < Arr1.length; i++) {    
+    sum += Arr1[i].length;
+  }
+  average = sum / Arr1.length;
+  return average;
+}
 
 // Bonus - Iteration #4.1
-function avg() {}
+function avg(Arr) {
+  if (Arr.length === 0){
+    return null;
+  }
+  for (let i = 0; i < Arr.length; i++) {
+    sum += Arr.length[i];
+  }
+  average = sum / Arr.length;
+  return average;
+}
+
+
+
 
 // Iteration #5: Unique arrays
 const wordsUnique = [
@@ -52,14 +110,39 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
+// function uniquifyArray(str1) {
+//   if ( str1.length === 0){
+//     return null;
+//   }
+//   const list1 = [...new set(str1.length)]
+//     return list1;
+//   }
+  function uniquifyArray(uniqued) {
+    if (uniqued.length === 0) {
+      return null;
+    }
+    
+    const uniqueArray = [];
+    
+    for (const item of uniqued) {
+      if (!uniqueArray.includes(item)) {
+        uniqueArray.push(item);
+      }
+    }
+    
+    return uniqueArray;
+  }
 
 
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
-function doesWordExist() {}
+function doesWordExist(str2) {
+  if ( str2 === 0){
+    return null;
+  } 
+}