From 63c73d5e89b1d61be91d5518b0ae859c934d283a Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?R=C3=A9my=20Lenoir?= Date: Thu, 21 Mar 2019 16:05:59 +0100 Subject: [PATCH] Update --- starter-code/src/functions-and-arrays.js | 61 ++++++- starter-code/src/solution.js | 204 +++++++++++++++++++++++ 2 files changed, 263 insertions(+), 2 deletions(-) create mode 100644 starter-code/src/solution.js diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js index 2fcd81e6e..71a7cfecd 100644 --- a/starter-code/src/functions-and-arrays.js +++ b/starter-code/src/functions-and-arrays.js @@ -1,6 +1,18 @@ // Find the maximum +function maxOfTwoNumbers(number1, number2) { + if (number1 > number2) { + return number1; + } else (number2 > number1) + return number2; +} // Finding Longest Word +function findLongestWord(words) { + const longestWord = words.sort(function(word1, word2) { + return word1.length - word2.length; + }); + return longestWord[0]; +} var words = [ 'mystery', 'brother', @@ -12,14 +24,42 @@ var words = [ ]; // Calculating a Sum - +function sumArray(arr) { + if (arr.length === 0) { + return 0; + } + let sum = 0; + for (let i = 0; i < arr.length; i++) { + sum += arr[i]; + } + return sum; +} var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; // Calculate the Average - +function averageNumbers(arr) { + if (arr.length === 0) { + return undefined; + } + let sum = 0; + for (let i = 0; i < arr.length; i++) { + sum += arr[i]; + } + return sum / arr.length; +} var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; // Array of Strings +function averageWordLength(arr) { + if (arr.length === 0) { + return undefined; + } + let sum = 0; + for (let i = 0; i < arr.length; i++) { + sum += arr[i].length; + } + return sum / arr.length; +} var wordsArr = [ 'seat', 'correspond', @@ -34,6 +74,18 @@ var wordsArr = [ ]; // Unique Arrays +function uniquifyArray(arr) { + if (arr.length === 0) { + return undefined; + } + let uniquifyArr = []; + for (let i = 0; i < arr.length; i++) { + if (uniquifyArr.indexOf(arr[i]) === -1) { + uniquifyArr.push(arr[i]); + } + } + return uniquifyArr; +} var wordsUnique = [ 'crab', 'poison', @@ -49,6 +101,11 @@ var wordsUnique = [ ]; // Finding Elements +function doesWordExist(arr, word) { + if (arr.length === 0) { + return false; + } +} var wordsFind = [ 'machine', 'subset', diff --git a/starter-code/src/solution.js b/starter-code/src/solution.js new file mode 100644 index 000000000..ee4ed6e65 --- /dev/null +++ b/starter-code/src/solution.js @@ -0,0 +1,204 @@ +// Find the maximum +function maxOfTwoNumbers(num1, num2) { + if (num1 > num2) { + return num1; + } else { + return num2; + } +} + +// Finding Longest Word +var words = ["mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"]; +function findLongestWord(list) { + if (list.length === 0) { + return; + } else { + var result = ""; + for (var i = 0; i < list.length; i++) { + if (list[i].length > result.length) { + result = list[i]; + } + } + return result; + } +} +// Calculating a Sum + +var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; +function sumArray(list) { + if (list.length === 0) { + return 0; + } else { + var sum = 0; + for (var i = 0; i < list.length; i++) { + sum += list[i]; + } + return sum; + } +} + +// Calculate the Average + +var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; +function averageNumbers(list) { + if (list.length === 0) { + return; + } else { + return sumArray(list) / list.length; + } +} + +// Array of Strings +var wordsArr = [ + "seat", + "correspond", + "linen", + "motif", + "hole", + "smell", + "smart", + "chaos", + "fuel", + "palace" +]; + +function averageWordLength(list) { + if (list.length === 0) { + return; + } else { + var numLet = 0; + for (var i = 0; i < list.length; i++) { + numLet += list[i].length; + } + return numLet / list.length; + } +} + +// Unique Arrays +var wordsUnique = [ + "crab", + "poison", + "contagious", + "simple", + "bring", + "sharp", + "playground", + "poison", + "communion", + "simple", + "bring" +]; + +function uniquifyArray(words) { + if (words.length === 0) { + return; + } else { + var uniquelist = []; + for (var i = 0; i < words.length; i++) { + if (uniquelist.indexOf(words[i]) === -1) { + uniquelist.push(words[i]); + } + } + return uniquelist; + } +} + +// Finding Elements +var wordsFind = [ + "machine", + "subset", + "trouble", + "starting", + "matter", + "eating", + "truth", + "disobedience" +]; + +function doesWordExist(list, word) { + if (list.length === 0) { + return false; + } else { + for (var i = 0; i < list.length; i++) { + if (word === list[i]) { + return true; + } + } + return false; + } +} + +// Counting Repetion +var wordsCount = [ + "machine", + "matter", + "subset", + "trouble", + "starting", + "matter", + "eating", + "matter", + "truth", + "disobedience", + "matter" +]; + +function howManyTimes(list, word) { + var numRep = 0; + if (list.length === 0) { + return false; + } else { + for (var i = 0; i < list.length; i++) { + if (word === list[i]) { + numRep++; + } + } + return numRep; + } +} + +// Bonus Quest + +var 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) { + var max = 0; + + for (var i = 0; i < matrix.length; i++) { + for (var j = 0; j < matrix[i].length - 3; j++) { + if (matrix[i][j] * matrix[i][j + 1] * matrix[i][j + 2] * matrix[i][j + 3] > max) { + max = matrix[i][j] * matrix[i][j + 1] * matrix[i][j + 2] * matrix[i][j + 3]; + } + } + } + + for (var i = 0; i < matrix.length - 3; i++) { + for (var j = 0; j < matrix[i].length; j++) { + if (matrix[i][j] * matrix[i + 1][j] * matrix[i + 2][j] * matrix[i + 3][j] > max) { + max = matrix[i][j] * matrix[i + 1][j] * matrix[i + 2][j] * matrix[i + 3][j]; + } + } + } + return max; +}