From 99206634baf66bf76a23aefbdd805870cecdbea1 Mon Sep 17 00:00:00 2001 From: FelixRodriguezG Date: Wed, 18 Jun 2025 15:17:40 +0200 Subject: [PATCH 1/2] completed until exercise 8 --- src/functions-and-arrays.js | 133 ++++++++++++++++++++++++++---------- 1 file changed, 97 insertions(+), 36 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 3a7dbec41..f59d0c080 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,41 +1,91 @@ // Iteration #1: Find the maximum -function maxOfTwoNumbers() {} +function maxOfTwoNumbers(a, b) { + return (a > b) ? a : b; +} // Iteration #2: Find longest word -const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot']; +const words = [ 'mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot' ]; -function findLongestWord() {} +function findLongestWord(words) { + if (!words.length) return null; + return words.reduce((acc, word) => + (acc.length < word.length) ? word : acc) +} // Iteration #3: Calculate the sum -const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; +const numbers = [ 6, 12, 1, 18, 13, 16, 2, 1, 8, 10 ]; -function sumNumbers() {} +function sumNumbers(numbers) { + if (!numbers.length) return 0; + return numbers.reduce((acc, value) => acc + value); +} // Iteration #3.1 Bonus: -function sum() {} +function sum(array) { + if (!array.length) return 0; + + if (array.some(el => typeof el === "object" || Array.isArray(el))) { + throw new Error('Unsupported data type'); + } + // Sumar elementos + return array.reduce((acc, value) => { + if (typeof value === 'string') { + return acc + value.length; + } else if (typeof value === 'boolean') { + return acc + (value ? 1 : 0); + } + return acc + value; + }, 0); +} + // Iteration #4: Calculate the average // Level 1: Array of numbers -const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; +const numbersAvg = [ 2, 6, 9, 10, 7, 4, 1, 9 ]; -function averageNumbers() {} +function averageNumbers(numbers) { + if (!numbers.length) return null; + let sum = numbers.reduce((acc, value) => acc + value) + return sum / numbers.length; +} // Level 2: Array of strings -const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace']; +const wordsArr = [ 'seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace' ]; + +function averageWordLength(words) { + if (!words.length) return null; + let sum = words.reduce((acc, value) => acc + value.length, 0) + return sum / words.length; + +} -function averageWordLength() { } // Bonus - Iteration #4.1 -function avg() {} +function avg(arr) { + if (!arr.length) return null; + const validTypes=['number','string','boolean'] + + return arr.reduce((acc, value) => { + if (!validTypes.includes(typeof value)) { + throw new Error("Unsupported data type"); + } + + if (typeof value === 'number') return acc + value; + if (typeof value === 'string') return acc + value.length; + if (typeof value === 'boolean') return acc + (value ? 1 : 0); + + }, 0) / arr.length; +} + // Iteration #5: Unique arrays const wordsUnique = [ @@ -52,14 +102,20 @@ const wordsUnique = [ 'bring' ]; -function uniquifyArray() {} +function uniquifyArray(arr) { + if (!arr.length) return null; + return Array.from(new Set(arr)) +} // Iteration #6: Find elements -const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience']; +const wordsFind = [ 'machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience' ]; -function doesWordExist() {} +function doesWordExist(arr, word) { + if (!arr.length) return null; + return arr.includes(word); +} @@ -78,35 +134,40 @@ const wordsCount = [ 'matter' ]; -function howManyTimes() {} +function howManyTimes(arr, word) { + return arr.filter( el => el===word).length +} // 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] + [ 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() {} +function greatestProduct(matrix) { + + + } From 46c711bf9314b6e78b77adbfecd7b8745eaf6121 Mon Sep 17 00:00:00 2001 From: FelixRodriguezG Date: Wed, 18 Jun 2025 17:30:29 +0200 Subject: [PATCH 2/2] solved lab --- src/functions-and-arrays.js | 78 ++++++++++++++++++++++++++++++++----- 1 file changed, 69 insertions(+), 9 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index f59d0c080..e1f14b177 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -72,17 +72,17 @@ function averageWordLength(words) { // Bonus - Iteration #4.1 function avg(arr) { if (!arr.length) return null; - const validTypes=['number','string','boolean'] + const validTypes = [ 'number', 'string', 'boolean' ] return arr.reduce((acc, value) => { if (!validTypes.includes(typeof value)) { throw new Error("Unsupported data type"); } - + if (typeof value === 'number') return acc + value; if (typeof value === 'string') return acc + value.length; if (typeof value === 'boolean') return acc + (value ? 1 : 0); - + }, 0) / arr.length; } @@ -102,7 +102,7 @@ const wordsUnique = [ 'bring' ]; -function uniquifyArray(arr) { +function uniquifyArray(arr) { if (!arr.length) return null; return Array.from(new Set(arr)) } @@ -112,7 +112,7 @@ function uniquifyArray(arr) { // Iteration #6: Find elements const wordsFind = [ 'machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience' ]; -function doesWordExist(arr, word) { +function doesWordExist(arr, word) { if (!arr.length) return null; return arr.includes(word); } @@ -134,8 +134,8 @@ const wordsCount = [ 'matter' ]; -function howManyTimes(arr, word) { - return arr.filter( el => el===word).length +function howManyTimes(arr, word) { + return arr.filter(el => el === word).length } @@ -165,9 +165,69 @@ const matrix = [ ]; function greatestProduct(matrix) { + let maxProduct = 0; + const rows = matrix.length; + const cols = matrix[ 0 ].length; + + // horizontal + for (let row = 0; row < rows; row++) { + for (let col = 0; col < cols; col++) { + let product = 1; + for (let limit = 0; limit < 4; limit++) { + product *= matrix[ row ][ col + limit ] + } + if (product > maxProduct) { + maxProduct = product; + + } + } + } + // vertical + for (let row = 0; row < rows - 4; row++) { + for (let col = 0; col < cols; col++) { + let product = 1; + for (let limit = 0; limit < 4; limit++) { + product *= matrix[ row + limit ][ col ] + } + if (product > maxProduct) { + maxProduct = product; + + } + } + // diagonals + for (let row = 0; row < rows - 4; row++) { + // empezamos en col=3 para no salirnos por la izquierda + for (let col = 3; col < cols; col++) { + // ↘ diagonales hacia la derecha + if (cols + 3 < cols) { + let product = 1; + for (let i = 0; i < 4; i++) { + product *= matrix[ row + i ][ col - i ]; // ↙ + } + if (product > maxProduct) { + maxProduct = product; + } + + } + + if (cols - 3 >= 0) { + let product = 1; + for (let i = 0; i < 4; i++) { + product *= matrix[ row + i ][ col - i ]; + } + if (product > maxProduct) { + maxProduct = product; + } + } + } + } + } + // ↙ diagonales hacia la izquierda + - - } + + return maxProduct; +}