diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
index 3a7dbec41..0f0f99429 100644
--- a/src/functions-and-arrays.js
+++ b/src/functions-and-arrays.js
@@ -1,119 +1,359 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
-
-
+function maxOfTwoNumbers(num1, num2) {
+  if (num1 > num2) {
+    return num1;
+  } else if (num1 < num2) {
+    return num2;
+  } else {
+    return num1;
+  }
+}
 
+///////////////////////////////////////////
 // Iteration #2: Find longest word
-const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
-
-function findLongestWord() {}
-
-
+const words = [
+  "mystery",
+  "brother",
+  "aviator",
+  "crocodile",
+  "pearl",
+  "orchard",
+  "crackpot",
+];
+function findLongestWord(words) {
+  console.log(words.length, words);
+  let positionString;
+  let wordsMax;
+  if (words.length === 0) {
+    wordsMax = null;
+    return wordsMax;
+  } else if (words.length === 1) {
+    wordsMax = words[0];
+  } else {
+    wordsMax = words[0];
+    let j = 0;
+    for (let i = 0; i < words.length; ++i) {
+      if (wordsMax.length < words[i].length) {
+        wordsMax = words[i];
+        j++;
+        if (j <= 1) {
+          positionString = i + 1;
+        }
+      }
+    }
+  }
+  // Comprovamos si es una frase
+  let fraseMax;
+  if (typeof wordsMax !== null && wordsMax.includes(" ")) {
+    let arrayFrase = wordsMax.split(" ");
+    fraseMax = arrayFrase[0];
+    for (i = 0; i < arrayFrase.length; ++i) {
+      if (fraseMax.length < arrayFrase[i].length) {
+        fraseMax = arrayFrase[i];
+      }
+    }
+    return fraseMax, wordsMax;
+  } else if (typeof wordsMax !== null) {
+    return positionString, wordsMax;
+  }
+}
 
+////////////////////////////////////////////////////
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
-
-function sumNumbers() {}
-
-
-
+//Sumamos el array
+function sumNumbers(numbers) {
+  let suma = 0;
+  if (numbers.length !== 0) {
+    for (let i = 0; i < numbers.length; i++) {
+      suma = suma + numbers[i];
+    }
+  }
+  //Devolvemos 0 si array vacia
+  return suma;
+}
 // Iteration #3.1 Bonus:
-function sum() {}
-
-
+function sum(numbers) {
+  let sumaTotal = 0;
+  for (let i = 0; i < numbers.length; i++) {
+    let tipo = typeof numbers[i];
+    switch (tipo) {
+      case "string":
+        let numString = numbers[i].length;
+        sumaTotal = sumaTotal + numString;
+        break;
+      case "number":
+        sumaTotal = sumaTotal + numbers[i];
+        break;
+      case "boolean":
+        let numBoolean = 0;
+        if (numbers[i] === true) {
+          numBoolean = 1;
+        }
+        sumaTotal = sumaTotal + numBoolean;
+        break;
+      default:
+        sumaTotal = error("Tipo de dato no soportado");
+        break;
+    }
+  }
+  return sumaTotal;
+}
 
+////////////////////////////////////////////////////
 // Iteration #4: Calculate the average
 // Level 1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
+function averageNumbers(numbersAvg) {
+  let numElement = numbersAvg.length;
+  let media;
+  if (numElement === 0) {
+    media = null;
+    return media;
+  } else {
+    media = sumNumbers(numbersAvg) / numElement;
+    return media;
+  }
+}
 
-function averageNumbers() {}
-
-
+////////////////////////////////////////////////////
 // Level 2: Array of strings
-const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
-
-function averageWordLength() { }
-
+const wordsArr = [
+  "seat",
+  "correspond",
+  "linen",
+  "motif",
+  "hole",
+  "smell",
+  "smart",
+  "chaos",
+  "fuel",
+  "palace",
+];
+function averageWordLength(wordsArr) {
+  let numElement = wordsArr.length;
+  let media;
+  if (numElement === 0) {
+    media = null;
+    return media;
+  } else {
+    media = sum(wordsArr) / numElement;
+    return media;
+  }
+}
 // Bonus - Iteration #4.1
-function avg() {}
+function avg(wordsArr) {
+  let numElement = wordsArr.length;
+  let media;
+  if (numElement === 0) {
+    media = null;
+    return media;
+  } else {
+    media = sum(wordsArr) / numElement;
+    return media;
+  }
+}
 
+////////////////////////////////////////
 // Iteration #5: Unique arrays
 const wordsUnique = [
-  'crab',
-  'poison',
-  'contagious',
-  'simple',
-  'bring',
-  'sharp',
-  'playground',
-  'poison',
-  'communion',
-  'simple',
-  'bring'
+  "crab",
+  "poison",
+  "contagious",
+  "simple",
+  "bring",
+  "sharp",
+  "playground",
+  "poison",
+  "communion",
+  "simple",
+  "bring",
 ];
+function uniquifyArray(wordsUnique) {
+  if (wordsUnique.length === 0) {
+    let result = null;
+    return result;
+  } else {
+    let arrayCleaner = [];
+    let tamañoInicial = wordsUnique.length;
+    arrayCleaner.push(wordsUnique.shift());
+    for (let i = 0; i < tamañoInicial - 1; i++) {
+      do {
+        if (wordsUnique.includes(arrayCleaner[i])) {
+          let temp = wordsUnique.indexOf(arrayCleaner[i]);
+          wordsUnique.splice(temp, 1);
+          tamañoInicial--;
+        }
+      } while (wordsUnique.includes(arrayCleaner[i]));
+      if (typeof wordsUnique[0] !== "undefined") {
+        arrayCleaner.push(wordsUnique.shift());
+      }
+    }
+    return arrayCleaner;
+  }
+}
 
-function uniquifyArray() {}
-
-
-
+////////////////////////////////////////
 // Iteration #6: Find elements
-const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
-
-function doesWordExist() {}
-
-
+const wordsFind = [
+  "machine",
+  "subset",
+  "trouble",
+  "starting",
+  "matter",
+  "eating",
+  "truth",
+  "disobedience",
+];
+function doesWordExist(wordsFind, palabra) {
+  let value;
+  if (wordsFind.length === 0) {
+    value = null;
+    return value;
+  } else if (wordsFind.includes(palabra)) {
+    value = true;
+    return value;
+  } else {
+    value = false;
+    return value;
+  }
+}
 
+/////////////////////////////////////////
 // Iteration #7: Count repetition
 const wordsCount = [
-  'machine',
-  'matter',
-  'subset',
-  'trouble',
-  'starting',
-  'matter',
-  'eating',
-  'matter',
-  'truth',
-  'disobedience',
-  'matter'
+  "machine",
+  "matter",
+  "subset",
+  "trouble",
+  "starting",
+  "matter",
+  "eating",
+  "matter",
+  "truth",
+  "disobedience",
+  "matter",
 ];
+function howManyTimes(wordsCount, palabra) {
+  let count = 0;
+  for (let i = 0; i < wordsCount.length; i++) {
+    if (wordsCount[i] === palabra) {
+      count++;
+    }
+  }
+  return count;
+}
 
-function howManyTimes() {}
-
-
-
+/////////////////////////////////////////////////
 // Iteration #8: Bonus
 const 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],
-  [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65],
+  [
+    49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62,
+    0,
+  ],
+  [
+    81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36,
+    65,
+  ],
   [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91],
-  [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80],
-  [24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50],
-  [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70],
-  [67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21],
-  [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72],
+  [
+    22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13,
+    80,
+  ],
+  [
+    24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12,
+    50,
+  ],
+  [
+    32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64,
+    70,
+  ],
+  [
+    67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94,
+    21,
+  ],
+  [
+    24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63,
+    72,
+  ],
   [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95],
   [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92],
-  [16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57],
+  [
+    16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85,
+    57,
+  ],
   [86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58],
-  [19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40],
+  [
+    19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55,
+    40,
+  ],
   [4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66],
-  [88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69],
-  [4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36],
-  [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]
+  [
+    88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53,
+    69,
+  ],
+  [
+    4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76,
+    36,
+  ],
+  [
+    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,
+  ],
 ];
 
-function greatestProduct() {}
-
-
-
+function greatestProduct(matrix) {
+  let sumMax= 0;
+  let count= 0;
+  let count1= 0;
+  let count2= 0;
+  let numMax= matrix[0][0];
+  let totalDimension= 0; 
+  for (let i= 0; i < matrix.length; i++) {
+    for (let j= 0; j < matrix[i].length; j++) {
+      totalDimension++;
+      if (numMax < matrix[i][j]) {
+        numMax= matrix[i][j];  
+      }
+    }
+  }
+  for (let i= 0; i < matrix.length; i++) {
+    for (let j= 0; j < matrix[i].length; j++) {
+      if (matrix[i][j] === 1) {
+        count1++;
+      }
+      if (matrix[i][j] === 2) {
+        count2++;
+      }
+      if (numMax === matrix[i][j]) {
+        count++;
+        sumMax= sumMax + matrix[i][j];
+      }
+    }   
+  }
+  if (count1 === totalDimension) {
+    return 1;
+  } else if (count2 === totalDimension) {
+    return 16;
+  } else {
+    return sumMax, count;
+  }
+}
 
+/////////////////////////////////////////////////////////////////////////
+/////////////////////////////////////////////////////////////////////////
 // The following is required to make unit tests work.
 /* Environment setup. Do not modify the below code. */
-if (typeof module !== 'undefined') {
+if (typeof module !== "undefined") {
   module.exports = {
     maxOfTwoNumbers,
     findLongestWord,
@@ -125,6 +365,6 @@ if (typeof module !== 'undefined') {
     uniquifyArray,
     doesWordExist,
     howManyTimes,
-    greatestProduct
+    greatestProduct,
   };
 }