From f9a934051d05d17ba1b1dec5058c3a659517f22c Mon Sep 17 00:00:00 2001
From: laura86bf <laura86bf@hotmail.com>
Date: Wed, 10 Aug 2022 17:03:08 +0200
Subject: [PATCH 1/5] iteration1

---
 js/index.js | 9 +++++++++
 1 file changed, 9 insertions(+)

diff --git a/js/index.js b/js/index.js
index 59e4af7fb..3b92facfa 100644
--- a/js/index.js
+++ b/js/index.js
@@ -1,6 +1,15 @@
 // Iteration 1: Names and Input
 //
+console.log ("I'm ready!");
+
+const hacker1 = "Manolo";
+console.log("The driver's name is " + hacker1 + ".");
+
+const hacker2 = "Google Chrome";
+console.log("The navigator's name is " + hacker2 + ".");
+
 // Iteration 2: Conditionals
 
 
 // Iteration 3: Loops
+

From c17dcb3214ea563b9d86d48c9cfdd9b82a447711 Mon Sep 17 00:00:00 2001
From: laura86bf <laura86bf@hotmail.com>
Date: Thu, 11 Aug 2022 23:32:43 +0200
Subject: [PATCH 2/5] iteration 2 + 3.1

---
 js/index.js | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/js/index.js b/js/index.js
index 3b92facfa..eb080dc8f 100644
--- a/js/index.js
+++ b/js/index.js
@@ -10,6 +10,17 @@ console.log("The navigator's name is " + hacker2 + ".");
 
 // Iteration 2: Conditionals
 
-
+if(hacker1.legth>hacker2.length){
+    console.log(`The driver has the longest name, it has ${hacker1.length}characters. `);
+}
+else if(hacker1.length<hacker2.length){
+    console.log(`It seems that the navigator has the longest name, it has ${hacker2.length} characters.`);
+}
+else{
+   console.log( `Wow, you both have equally long names, XX characters!`);
+}
 // Iteration 3: Loops
 
+for(i=0;i<hacker1.length,i++){
+    console.log(hacker[i].toUpperCase);
+}

From 62d737a0c48ae8b2b1d6981978d3212029aa6204 Mon Sep 17 00:00:00 2001
From: laura86bf <laura86bf@hotmail.com>
Date: Sat, 13 Aug 2022 11:08:45 +0200
Subject: [PATCH 3/5] iteration 2

---
 js/index.js | 11 ++++++++---
 1 file changed, 8 insertions(+), 3 deletions(-)

diff --git a/js/index.js b/js/index.js
index eb080dc8f..1bc1dfe12 100644
--- a/js/index.js
+++ b/js/index.js
@@ -21,6 +21,11 @@ else{
 }
 // Iteration 3: Loops
 
-for(i=0;i<hacker1.length,i++){
-    console.log(hacker[i].toUpperCase);
-}
+//3.1
+
+const Upper = hacker1.split('').join(' ').toUpperCase();
+console.log(Upper);
+
+//3.2
+
+const reverse = hacker2.split("").reverse().join("");

From 1e57c5bd1438eba42aa4d14df8668495a8573deb Mon Sep 17 00:00:00 2001
From: laura86bf <laura86bf@hotmail.com>
Date: Tue, 16 Aug 2022 18:26:42 +0200
Subject: [PATCH 4/5] 3.2 finished, lab done

---
 js/index.js | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)

diff --git a/js/index.js b/js/index.js
index 1bc1dfe12..424b7ba07 100644
--- a/js/index.js
+++ b/js/index.js
@@ -29,3 +29,28 @@ console.log(Upper);
 //3.2
 
 const reverse = hacker2.split("").reverse().join("");
+console.log(reverse);
+
+//3.3
+let lista = [hacker1,hacker2];
+
+lista.sort();
+
+if(lista[0]===hacker1){
+
+    console.log(`The driver's name goes first`);
+
+}
+
+else if(lista[0]===hacker2){
+
+    console.log(`Yo, the navigator goes first definitely`);
+
+}
+
+else{
+
+    console.log(`What?! You both have the same name? `);
+
+}
+

From c542af8cb3e26184bb2273aa6eecb5c2e27b8a58 Mon Sep 17 00:00:00 2001
From: laura86bf <laura86bf@hotmail.com>
Date: Thu, 18 Aug 2022 21:18:52 +0200
Subject: [PATCH 5/5] solved

---
 js/index.js | 292 ++++++++++++++++++++++++++++++++++++++++++----------
 1 file changed, 236 insertions(+), 56 deletions(-)

diff --git a/js/index.js b/js/index.js
index 424b7ba07..3d50a349d 100644
--- a/js/index.js
+++ b/js/index.js
@@ -1,56 +1,236 @@
-// Iteration 1: Names and Input
-//
-console.log ("I'm ready!");
-
-const hacker1 = "Manolo";
-console.log("The driver's name is " + hacker1 + ".");
-
-const hacker2 = "Google Chrome";
-console.log("The navigator's name is " + hacker2 + ".");
-
-// Iteration 2: Conditionals
-
-if(hacker1.legth>hacker2.length){
-    console.log(`The driver has the longest name, it has ${hacker1.length}characters. `);
-}
-else if(hacker1.length<hacker2.length){
-    console.log(`It seems that the navigator has the longest name, it has ${hacker2.length} characters.`);
-}
-else{
-   console.log( `Wow, you both have equally long names, XX characters!`);
-}
-// Iteration 3: Loops
-
-//3.1
-
-const Upper = hacker1.split('').join(' ').toUpperCase();
-console.log(Upper);
-
-//3.2
-
-const reverse = hacker2.split("").reverse().join("");
-console.log(reverse);
-
-//3.3
-let lista = [hacker1,hacker2];
-
-lista.sort();
-
-if(lista[0]===hacker1){
-
-    console.log(`The driver's name goes first`);
-
-}
-
-else if(lista[0]===hacker2){
-
-    console.log(`Yo, the navigator goes first definitely`);
-
-}
-
-else{
-
-    console.log(`What?! You both have the same name? `);
-
-}
-
+// Iteration #1: Find the maximum
+
+function maxOfTwoNumbers(number1, number2) {
+    if(number1>number2){
+      return number1;
+    }
+    else if(number1<number2){
+      return number2;
+    }
+    else{
+      return true;
+    }
+  
+  }
+  
+  let result = maxOfTwoNumbers(8,9);
+  
+  console.log(`Iteration 1, answer: ${result}`);
+  console.log(`Iteration 1, answer: ${number1}`);
+  
+  
+  
+  // Iteration #2: Find longest word
+  const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
+  
+  function findLongestWord(array) {
+    let ganador = array[0];
+    for(let i=1;i<array.length;i++){
+      if (ganador.length > array[i].length){
+  
+      }
+      else{
+        ganador = array[i];
+      }
+    }
+    return ganador;
+  }
+  
+  let findLongestWordResult = findLongestWord(words);
+  console.log(`Iteration 2, answer: ${findLongestWordResult}`);
+  
+  
+  
+  
+  // Iteration #3: Calculate the sum
+  const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
+  let  resultadoSuma=0;
+  
+  function sumNumbers(array) {
+    
+    for(let i=0;i<array.length;i++){
+      resultadoSuma += array[i];
+      
+    }
+    return resultadoSuma;
+  }
+   sumNumbers(numbers);
+  console.log(`Iteration 3, answer: ${resultadoSuma}`);
+  
+  // Iteration #3.1 Bonus:
+  function sum() {}
+  
+  
+  
+  // Iteration #4: Calculate the average
+  // Level 1: Array of numbers
+  const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
+   let average;
+  function averageNumbers(array) {
+    let sumaElementos = sumNumbers(array);
+    /*console.log(`Iteration 3, answer: ${resultadoSuma}`);*/
+    average = sumaElementos/array.length;
+    return average;
+  }
+  resultadoSuma=0;
+  averageNumbers(numbersAvg);
+  console.log(`Iteration 4,level 1, answer: ${average}`);
+  
+  // Level 2: Array of strings
+  const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
+  let sumatorio=0;
+  let longitudArray;
+  let avgWords;
+  function averageWordLength(arrayOfWords) {
+    longitudArray= arrayOfWords.length;
+    for(let i=0;i<arrayOfWords.length;i++){
+      sumatorio += arrayOfWords[i].length;
+     /* console.log(`${sumatorio}, ${arrayOfWords[i].length}`);*/
+    }
+    avgWords = sumatorio/longitudArray;
+   /* console.log(`${sumatorio}`);*/
+    return avgWords;
+   }
+  averageWordLength(wordsArr);
+  console.log(`Iteration 4,level 2, answer: ${avgWords}`);
+  
+  // Bonus - Iteration #4.1
+  function avg() {}
+  
+  // Iteration #5: Unique arrays
+  const wordsUnique = [
+    'crab',
+    'poison',
+    'contagious',
+    'simple',
+    'bring',
+    'sharp',
+    'playground',
+    'poison',
+    'communion',
+    'simple',
+    'bring'
+  ];
+  /*
+  function uniquifyArray(arrayOfWords) {
+    for(let i=0;i<arrayOfWords.length;i++){
+      for(let j=0;j<arrayOfWords.length;j++){
+        if(i!=j){
+          if(arrayOfWords[i]===arrayOfWords(j)){
+            //slice
+          }
+        }
+      }
+    }
+  }
+  
+  uniquifyArray(wordsUnique);
+  console.log(wordsUnique);*/
+  
+  // Iteration #6: Find elements
+  const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
+  
+  function doesWordExist(arrayOfWords, wordToSearch) {
+    let contador=0;
+    let contador2=0;
+    console.log(`word ${wordToSearch}`);
+    for(let i=0;i<arrayOfWords.length;i++){
+       console.log(`aow ${arrayOfWords[i]} ${wordToSearch}`);
+      if(arrayOfWords[i]===wordToSearch){
+        console.log(`if ${contador}`);
+        contador += 1;  
+        console.log(`if ${contador}`);
+        return true;
+      }
+      
+      else{
+        contador2;
+        return false;
+        
+      }
+  console.log(contador2);
+      
+    }
+   
+  }
+  const string = 'disobedience';
+  doesWordExist(wordsFind, string);
+  
+  
+  
+  // Iteration #7: Count repetition
+  const wordsCount = [
+    'machine',
+    'matter',
+    'subset',
+    'trouble',
+    'starting',
+    'matter',
+    'eating',
+    'matter',
+    'truth',
+    'disobedience',
+    'matter'
+  ];
+  let contador= 0;
+  
+  function howManyTimes(arrayOfWords, wordToSearch) {
+    for(let i=0;i<arrayOfWords.length;i++){
+      if(arrayOfWords[i] === wordToSearch){
+        
+        contador+=1;
+      }
+    }
+    return contador;
+  }
+  
+  
+  
+  // 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],
+    [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],
+    [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],
+    [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],
+    [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]
+  ];
+  
+  function greatestProduct() {}
+  
+  
+  
+  
+  // The following is required to make unit tests work.
+  /* Environment setup. Do not modify the below code. */
+  if (typeof module !== 'undefined') {
+    module.exports = {
+      maxOfTwoNumbers,
+      findLongestWord,
+      sumNumbers,
+      sum,
+      averageNumbers,
+      averageWordLength,
+      avg,
+      uniquifyArray,
+      doesWordExist,
+      howManyTimes,
+      greatestProduct
+    };
+  }
+  
+  
\ No newline at end of file