diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
index 3a7dbec41..a1e07fc2a 100644
--- a/src/functions-and-arrays.js
+++ b/src/functions-and-arrays.js
@@ -1,43 +1,99 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
-
-
+function maxOfTwoNumbers(a, b) {
+  if (a < b){
+    return a
+  }
+  return b 
+}
 
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
+function findLongestWord(words) {
+    let longestWord = words[0];
+
+    for (let i = 1; i < words.length; i++) {
+        if (words[i].length > longestWord.length) {
+            longestWord = words[i];
+        }
+    }
+
+    return longestWord;
+}
+
+console.log(findLongestWord(words));
+
 
 
 
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
+function sumNumbers() {
+    let sum = 0;
+    for (let i = 0; i < numbers.length; i++) {
+        sum += numbers[i];
+    }
+    return sum;
+}
 
+console.log(sumNumbers());
 
 
 // Iteration #3.1 Bonus:
-function sum() {}
+const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10];
+
+function sum(mixedArr) {
+  let sumNums = 0;
+
+  for (let i = 0; i < mixedArr.length; i++) {
+    if (typeof mixedArr[i] === 'string') {
+      sumNums += mixedArr[i].length; 
+    } else {
+      sumNums += mixedArr[i];
+    }
+  }
+
+  return sumNums; 
+}
+
+console.log(sum(mixedArr));
+
+
 
 
 
 // Iteration #4: Calculate the average
 // Level 1: Array of numbers
-const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
-
-function averageNumbers() {}
 
+const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
+ sumNumbers (numbersAvg);
+function averageNumbers(numbersAvg) {
+  if (!numbersAvg.length) return;
+  return sumNumbers (numbersAvg) / numbersAvg.length
+}
+console.log(averageNumbers(numbersAvg));
 
 // Level 2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
 
-function averageWordLength() { }
-
+function averageWordLength(wordsArr) { 
+  if (!wordsArr.length) return;
+return sum (wordsArr) / words.length
+}
+console.log(averageWordLength(wordsArr))
 // Bonus - Iteration #4.1
-function avg() {}
+
+const mixedArr2 = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10];
+
+function avg(mixedArr2) {
+  if (!mixedArr2.length) return;
+return sum (mixedArr2) / words.length ;
+}
+console.log (avg(mixedArr2));
 
 // Iteration #5: Unique arrays
+
 const wordsUnique = [
   'crab',
   'poison',
@@ -52,16 +108,35 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
+function uniquifyArray(wordsUnique) {
+  let wordsUniquify = [];
+
+  for (let i = 0; i < wordsUnique.length - 1; i++) {
+    if (wordsUniquify.indexOf(wordsUnique[i]) === -1) {
+      wordsUniquify.push(wordsUnique[i]);
+    }
+  }
+
+  return wordsUniquify;
+}
+
+console.log(uniquifyArray(wordsUnique));
 
 
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
-function doesWordExist() {}
-
+function doesWordExist(wordToSearch) {
+  for (let i = 0; i < wordsFind.length; i++) {
+    if (wordsFind[i] === wordToSearch) {
+      return true;
+    }
+  }
+  return false;
+}
 
+console.log(doesWordExist('gun'));
 
 // Iteration #7: Count repetition
 const wordsCount = [
@@ -78,9 +153,17 @@ const wordsCount = [
   'matter'
 ];
 
-function howManyTimes() {}
-
+function howManyTimes(wordToSearch) {
+  let count = 0;
+  for (let i = 0; i < wordsCount.length; i++) {
+    if(wordsCount[i] === wordToSearch){
+      count++;
+    }
+  }
+  return count;
+}
 
+console.log(howManyTimes('matter'));
 
 // Iteration #8: Bonus
 const matrix = [