From ec764b55582376a2f29904ec664ded7d782c4625 Mon Sep 17 00:00:00 2001 From: Doha Kaddaf Date: Sat, 13 Apr 2024 14:56:15 +0200 Subject: [PATCH 1/4] exercices without last bonus --- src/functions-and-arrays.js | 286 ++++++++++++++++++++++++++++-------- 1 file changed, 225 insertions(+), 61 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 3a7dbec41..8d5da6c03 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,119 +1,283 @@ // Iteration #1: Find the maximum -function maxOfTwoNumbers() {} - - +function maxOfTwoNumbers(a, b) { + if (a > b) { + return a; + } + return b; +} // 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(wordsArray) { + let longest_word = wordsArray[0]; + for (let word of wordsArray) { + if (word.length > longest_word.length) { + longest_word = word; + } + } + return longest_word; +} +console.log(findLongestWord(words)); // Iteration #3: Calculate the sum const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; -function sumNumbers() {} +function sumNumbers(numbersArray) { + let sum = 0; + for (let i = 0; i < numbersArray.length; i++) { + sum += numbersArray[i]; + } + return sum; +} +console.log(sumNumbers(numbers)); +const mixedArr = [6, 12, "miami", 1, true, "barca", "200", "lisboa", 8, 10]; -// Iteration #3.1 Bonus: -function sum() {} +// should return: 57 +// Iteration #3.1 Bonus: +function sum(genericArray) { + const allowedTypes = ["string", "number", "boolean"]; + let sum = 0; + for (let i = 0; i < genericArray.length; i++) { + elementType = typeof genericArray[i]; + if (!allowedTypes.includes(elementType)) { + throw new Error(`Only ${allowedTypes} are allowed`); + } + + if (elementType === "string") { + sum += genericArray[i].length; + } else { + sum += genericArray[i]; + } + } + return sum; +} +console.log(sum(mixedArr)); // Iteration #4: Calculate the average // Level 1: Array of numbers const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; -function averageNumbers() {} +function averageNumbers(numbersArray) { + if (!numbersArray.length) { + return 0; + } + return sumNumbers(numbersArray) / numbersArray.length; +} +console.log(averageNumbers(numbersAvg)); // 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(wordsArray) { + if (!wordsArray.length) { + return 0; + } + wordsLengthArr = wordsArray.map(function (wrd) { + return wrd.length; + }); + return sumNumbers(wordsLengthArr) / wordsArray.length; +} -function averageWordLength() { } +console.log(averageWordLength(wordsArr)); // Bonus - Iteration #4.1 -function avg() {} +function avg(genericArray) { + if (!genericArray.length) { + return 0; + } + return sum(genericArray) / genericArray.length; +} + +console.log(avg(wordsArr)); +console.log(avg(mixedArr)); // 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() {} - +function uniquifyArray(wordsUnique) { + uniqueWordsResult = []; + for (let word of wordsUnique) { + if (!uniqueWordsResult.includes(word)) { + uniqueWordsResult.push(word); + } + } + return uniqueWordsResult; +} +console.log(uniquifyArray(wordsUnique)); // 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(words, wordToSearch) { + if (words.indexOf(wordToSearch) != -1) { + return true; + } + return false; +} +console.log(doesWordExist(wordsFind, "disobedience")); // 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() {} - +function howManyTimes(words, wordToSearch) { + let wrdsCount = 0; + for (let wrd of words) { + if (wrd === wordToSearch) { + wrdsCount += 1; + } + } + return wrdsCount +} +console.log(howManyTimes(wordsCount, "matter")); // 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(arrayOfArrays) { + highest_prod = 0 + for (let i=0; i< arrayOfArrays.length; i++){ + currentArray = arrayOfArrays[i] + for (let j=0; j a * b ) + if (current_prod > highest_prod){ + highest_prod = current_prod + } + + } + } + return highest_prod +} +console.log(greatestProduct(matrix)) // 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 +289,6 @@ if (typeof module !== 'undefined') { uniquifyArray, doesWordExist, howManyTimes, - greatestProduct + greatestProduct, }; } From ec193d0a5e811b8f6643b2e00a15cb33cde878c9 Mon Sep 17 00:00:00 2001 From: Doha Kaddaf Date: Sat, 13 Apr 2024 15:21:46 +0200 Subject: [PATCH 2/4] add bonus question 8 --- src/functions-and-arrays.js | 45 ++++++++++++++++++++++++++++--------- 1 file changed, 34 insertions(+), 11 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 8d5da6c03..29964d738 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -187,7 +187,7 @@ function howManyTimes(words, wordToSearch) { wrdsCount += 1; } } - return wrdsCount + return wrdsCount; } console.log(howManyTimes(wordsCount, "matter")); @@ -258,22 +258,45 @@ const matrix = [ ], ]; +let simpleArrayOfArrays = [ + [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(arrayOfArrays) { - highest_prod = 0 - for (let i=0; i< arrayOfArrays.length; i++){ - currentArray = arrayOfArrays[i] - for (let j=0; j a * b ) - if (current_prod > highest_prod){ - highest_prod = current_prod + let highestProd = 0; + for (let i = 0; i < arrayOfArrays.length; i++) { + for (let j = 0; j < arrayOfArrays[i].length; j++) { + if (j < arrayOfArrays[i].length - 3) { + currentProd = + arrayOfArrays[i][j] * + arrayOfArrays[i][j + 1] * + arrayOfArrays[i][j + 2] * + arrayOfArrays[i][j + 3]; + if (currentProd > highestProd) { + highestProd = currentProd; + } + } + if (i < arrayOfArrays[j].length - 3) { + columnProd = + arrayOfArrays[i][j] * + arrayOfArrays[i + 1][j] * + arrayOfArrays[i + 2][j] * + arrayOfArrays[i + 3][j]; + if (currentProd > highestProd) { + highestProd = currentProd; + } } - } } - return highest_prod + + return highestProd; } -console.log(greatestProduct(matrix)) +console.log(greatestProduct(simpleArrayOfArrays)); // The following is required to make unit tests work. /* Environment setup. Do not modify the below code. */ From 798ede109596fd53e3c52d0b9089f95849d17fee Mon Sep 17 00:00:00 2001 From: Doha Kaddaf Date: Sat, 13 Apr 2024 15:26:07 +0200 Subject: [PATCH 3/4] finish diagonals bonus question 8 --- src/functions-and-arrays.js | 20 ++++++++++++++++++++ 1 file changed, 20 insertions(+) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 29964d738..f409cc612 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -298,6 +298,26 @@ function greatestProduct(arrayOfArrays) { console.log(greatestProduct(simpleArrayOfArrays)); +function greatestProductOfDiagonals(arrayOfArrays) { + let highestProd = 0; + for (let i = 0; i < arrayOfArrays.length - 3; i++) { + for (let j = 0; j < arrayOfArrays[i].length - 3; j++) { + currentProd = + arrayOfArrays[i][j] * + arrayOfArrays[i + 1][j + 1] * + arrayOfArrays[i + 2][j + 2] * + arrayOfArrays[i + 3][j + 3]; + if (currentProd > highestProd) { + highestProd = currentProd; + } + } + } + + return highestProd; +} + +console.log(greatestProductOfDiagonals(simpleArrayOfArrays)); + // The following is required to make unit tests work. /* Environment setup. Do not modify the below code. */ if (typeof module !== "undefined") { From aac42770ca21ebebb4b2cec8a356c94898c3c038 Mon Sep 17 00:00:00 2001 From: Doha Kaddaf Date: Sat, 13 Apr 2024 15:28:58 +0200 Subject: [PATCH 4/4] fix all jasmin specs --- src/functions-and-arrays.js | 15 ++++++++++++--- 1 file changed, 12 insertions(+), 3 deletions(-) diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index f409cc612..c3d602fe2 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -18,6 +18,9 @@ const words = [ ]; function findLongestWord(wordsArray) { + if (!wordsArray.length) { + return null; + } let longest_word = wordsArray[0]; for (let word of wordsArray) { if (word.length > longest_word.length) { @@ -73,7 +76,7 @@ const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; function averageNumbers(numbersArray) { if (!numbersArray.length) { - return 0; + return null; } return sumNumbers(numbersArray) / numbersArray.length; } @@ -96,7 +99,7 @@ const wordsArr = [ function averageWordLength(wordsArray) { if (!wordsArray.length) { - return 0; + return null; } wordsLengthArr = wordsArray.map(function (wrd) { return wrd.length; @@ -109,7 +112,7 @@ console.log(averageWordLength(wordsArr)); // Bonus - Iteration #4.1 function avg(genericArray) { if (!genericArray.length) { - return 0; + return null; } return sum(genericArray) / genericArray.length; } @@ -133,6 +136,9 @@ const wordsUnique = [ ]; function uniquifyArray(wordsUnique) { + if (!wordsUnique.length) { + return null; + } uniqueWordsResult = []; for (let word of wordsUnique) { if (!uniqueWordsResult.includes(word)) { @@ -157,6 +163,9 @@ const wordsFind = [ ]; function doesWordExist(words, wordToSearch) { + if (!words.length) { + return null; + } if (words.indexOf(wordToSearch) != -1) { return true; }