functions-and-arrays.js

// Iteration #1: Find the maximum
function maxOfTwoNumbers( num1, num2) {
  if (num1 > num2) {
    return num1;
  } 
   else if ( num1 < num2 ) {
    return num2;
  }
  
  else if ( num1 == num2 ) {
    return num1 = num2;
  }
}
console.log(maxOfTwoNumbers(22, 10));

const maxOfTwoNumbers2 = (num1, num2) => num1 > num2 ? num1 : num2
console.log(maxOfTwoNumbers2(8, 5)); 


// Iteration #2: Find longest word
const words = ['mystery', 'brother', 'aviator', 'crocodilssse', 'pearl', 'orchard', 'crackpot'];

function findLongestWord(words) {

  if (words.length === 0) {
    return null;
  }

  if (words.length === 1) {
    return words[0]
  }

  let longestWord = words[0];

  for (const word of words) {

    if (word.length > longestWord.length) 
      longestWord = word
  }

    return longestWord;
  
  
}
const findLongestWord2 = (words) => {
  if (words.length === 0) return null

  return words.reduce((longest,current) =>

    current.length > longest.length ? current : longest
  )
  }
  
 const test3 = words.reduce((longest,current) => current.length > longest.length ? current : longest)
  
console.log(test3)
  

console.log(findLongestWord2(words))
console.log(findLongestWord(words))

// Iteration #3: Calculate the sum
const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];

function sumNumbers(numbers1) {
  if (numbers1.length === 0)
    return 0;
  if (numbers1.length === 1) {
    return numbers1[0];
  }
  if (numbers1.every(num => num === 0)) {
    return 0;
  }
  let sum = 0;
  for (const number1 of numbers1) {
    sum += number1;
  }
  return sum;
}
console.log(sumNumbers(numbers));

const total = numbers.reduce((acc, currentValue) => acc + currentValue)

console.log(total)


// Iteration #3.1 Bonus:
const numbers3 = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];

function sum(miParametro) {
  let sum = 0
  for ( const item of miParametro) {
  
  if (typeof item === "number") {
    sum += item;
  }
  else if (typeof item === "boolean") {
    sum += item ? 1 : 0;
  
  }
  else if (typeof item === "string") {
    sum += item.length;
  }
  else if (typeof item === "object") {
    throw new Error("❌ Error: Unsupported data type.");
}
  }
  return sum;
}


console.log(sum(numbers3));



// Iteration #4: Calculate the average
// Level 1: Array of numbers
const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];



function averageNumbers(miParametro2) {
  // Verificar si el arreglo está vacío
  if (miParametro2.length === 0) {
    return null; // Si está vacío, retornamos null
  }

  // Si no está vacío, calculamos la suma y luego el promedio
  const totalSum = sum(miParametro2);
  return totalSum / miParametro2.length;
}






console.log(averageNumbers(numbersAvg));


// Level 2: Array of strings
const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];

function averageWordLength(miParametro3) { 
  let totalLength = 0;

  for ( const item of miParametro3) {
    totalLength += item.length;
  }
  return totalLength / miParametro3.length;
}

console.log(averageWordLength(wordsArr))

// Bonus - Iteration #4.1
const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10];

function avg(miParametro4) {

  let average = 0
  for ( const item of miParametro4) {
  
  if (typeof item === "number") {
    average += item;
  }
  else if (typeof item === "boolean") {
    average += item ? 1 : 0;
  
  }
  else if (typeof item === "string") {
    average += item.length;
  }
  else if (typeof item === "object") {
    throw new Error("❌ Error: Unsupported data type.");
}


}
return average / miParametro4.length
}

console.log(avg(mixedArr))

// Iteration #5: Unique arrays
const wordsUnique = [
  'crab',
  'poison',
  'contagious',
  'simple',
  'bring',
  'sharp',
  'playground',
  'poison',
  'communion',
  'simple',
  'bring'
];

function uniquifyArray(arr, newValue) {
 
    const uniqueArr = [];  // Arreglo para almacenar los elementos únicos
  
    // Eliminamos duplicados
    for (const item of arr) {
      if (!uniqueArr.includes(item)) {
        uniqueArr.push(item);
      }
    }
  
    // Añadimos el nuevo valor al final
    uniqueArr.push(newValue);
  
    return uniqueArr;  // Devolvemos el arreglo con los elementos únicos y el nuevo valor
  }

console.log(uniquifyArray(wordsUnique, 'newWord'));  // Añade 'newWord' al final


// Iteration #6: Find elements


const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];

function doesWordExist(words, foundWord) {
  // Si el array está vacío, retornamos null
  if (words.length === 0) {
    return null;
  }
  
  // Devolvemos true si la palabra existe en el array, sino false
  return words.includes(foundWord);
}

// Ejecución correcta con los dos argumentos
console.log(doesWordExist(wordsFind, "machine")); // ✅ true
console.log(doesWordExist(wordsFind, "hello")); 
console.log(doesWordExist(wordsFind, "caca"));  // ✅ false
console.log(doesWordExist([], "machine"));       // ✅ null



// Iteration #7: Count repetition
const wordsCount = [
  'machine',
  'matter',
  'subset',
  'trouble',
  'starting',
  'matter',
  'eating',
  'matter',
  'truth',
  'disobedience',
  'matter'
];




const count = wordsCount.reduce((acc, word) => {
  acc[word] = (acc[word] || 0) + 1;
  return acc;
}, {});
console.log(count);



// 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(matrix) {
  let maxProduct = 0;

  const rows = matrix.length;
  const cols = matrix[0].length;

  // Recorremos la matriz
  for (let i = 0; i < rows; i++) {
    for (let j = 0; j < cols; j++) {

      // Producto horizontal
      if (j + 3 < cols) {
        const horizontalProduct = matrix[i][j] * matrix[i][j + 1] * matrix[i][j + 2] * matrix[i][j + 3];
        maxProduct = Math.max(maxProduct, horizontalProduct);
      }

      // Producto vertical
      if (i + 3 < rows) {
        const verticalProduct = matrix[i][j] * matrix[i + 1][j] * matrix[i + 2][j] * matrix[i + 3][j];
        maxProduct = Math.max(maxProduct, verticalProduct);
      }

      // Producto diagonal (de arriba a la izquierda a abajo a la derecha)
      if (i + 3 < rows && j + 3 < cols) {
        const diagonalProduct1 = matrix[i][j] * matrix[i + 1][j + 1] * matrix[i + 2][j + 2] * matrix[i + 3][j + 3];
        maxProduct = Math.max(maxProduct, diagonalProduct1);
      }

      // Producto diagonal (de arriba a la derecha a abajo a la izquierda)
      if (i + 3 < rows && j - 3 >= 0) {
        const diagonalProduct2 = matrix[i][j] * matrix[i + 1][j - 1] * matrix[i + 2][j - 2] * matrix[i + 3][j - 3];
        maxProduct = Math.max(maxProduct, diagonalProduct2);
      }
    }
  }

  return maxProduct;
}




// 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
  };
}