From c58e5cedfd5e50afbdfc6539e5c1759b53d493dd Mon Sep 17 00:00:00 2001 From: David Mejia Date: Fri, 16 May 2025 13:54:06 -0500 Subject: [PATCH] Solved --- src/functions-and-arrays.js | 170 +++++++++++++++++++++++++----------- 1 file changed, 121 insertions(+), 49 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 3a7dbec..583baff 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,24 +1,54 @@ // Iteration #1: Find the maximum -function maxOfTwoNumbers() {} +function maxOfTwoNumbers(n1,n2) { + return Math.max(n1,n2) +} // Iteration #2: Find longest word const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot']; -function findLongestWord() {} +function findLongestWord() { + let longest = words[0]; + for (const word of words) { + if (word.length > longest.length) { + longest = word; + } + } + return longest; +} // 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(const number of numbers){ + sum +=number + } + return sum +} // Iteration #3.1 Bonus: -function sum() {} +function sum(items) { + let sum =0; + for(const item of items){ + if(typeof item =='number'){ + sum+=item + } + if(typeof item == 'string'){ + sum+= item.length + } + if(typeof item == 'boolean'){ + sum+= Number(item) + } + } + return sum +} @@ -26,16 +56,43 @@ function sum() {} // Level 1: Array of numbers const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; -function averageNumbers() {} +function averageNumbers(numbers) { + let total =0; + + for(const number of numbers){ + total +=number + } + return total/numbers.length +} // Level 2: Array of strings const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace']; -function averageWordLength() { } +function averageWordLength(words) { + let total =0; + for(const word of words){ + total+= word.length + } + return total / words.length; +} // Bonus - Iteration #4.1 -function avg() {} +function avg(items) { + let total =0; + for(const item of items){ + if (typeof item == 'number') { + total += item; + } + if (typeof item == 'string') { + total += item.length; + } + if (typeof item == 'boolean') { + total += Number(item); + } + } + return total / items.length; +} // Iteration #5: Unique arrays const wordsUnique = [ @@ -52,14 +109,29 @@ const wordsUnique = [ 'bring' ]; -function uniquifyArray() {} +function uniquifyArray(items) { + let arrayResult= []; + for(const item of items){ + if(arrayResult.indexOf(item)==-1){ + arrayResult.push(item) + } + } + return arrayResult +} // Iteration #6: Find elements const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience']; -function doesWordExist() {} +function doesWordExist(words, word) { + for (let i = 0; i < words.length; i++) { + if (words[i] == word) { + return true; + } + } + return false; +} @@ -78,53 +150,53 @@ const wordsCount = [ 'matter' ]; -function howManyTimes() {} +function howManyTimes(words, word) { + let counter =0; + for (let i = 0; i < words.length; i++) { + if (words[i] == word) { + counter++ + } + } + return counter; +} // 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] +matrix = [ + [1, 2, 3, 4, 5], + [1, 20, 3, 4, 5], + [1, 20, 3, 4, 5], + [1, 20, 3, 4, 5], + [1, 4, 3, 4, 5] ]; -function greatestProduct() {} +function greatestProduct(matrix) { + let longest_product = 0; + let product_horizontal = 0; + let product_vertical = 0; + for (let fil = 0; fil < matrix.length; fil++) { + for (let col = 0; col < matrix[fil].length; col++) { + if (matrix.length - fil >= 4) { + product_vertical = matrix[fil][col] * matrix[fil + 1][col] * matrix[fil + 2][col] * matrix[fil + 3][col]; + } + + if (matrix[fil].length - col >= 4) { + product_horizontal = matrix[fil][col] * matrix[fil][col + 1] * matrix[fil][col + 2] * matrix[fil][col + 3]; + } + if (product_horizontal > longest_product) { + longest_product = product_horizontal; + } + if (product_vertical > longest_product) { + longest_product = product_vertical; + } + } + } + return longest_product; +} + + -// 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 - }; -}