[FTRMT102023] Elise Jonkers

src/functions-and-arrays.js

@@ -1,19 +1,38 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
-
-
+function maxOfTwoNumbers(number1, number2) {
+  if (number1 > number2){
+    return number1
+  } else {
+    return number2
+  }
+}
 
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
-
+function findLongestWord(arrayWord){
+ if(!arrayWord.length){return null}
+ let word = '';
+  for (let i = 0; i < arrayWord.length; i++) {
+    if (word.length < arrayWord[i].length) {
+      word = arrayWord[i];
+    }
+  }
+  return word;
+}
 
 
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
+function sumNumbers(arrayNumber) {
+  if(!arrayNumber.length){return 0}
+  let totalSum = 0
+  for(let i = 0; i < arrayNumber.length; i++){
+    totalSum += arrayNumber[i]
+  }
+  return totalSum
+}
 
 
 
@@ -26,13 +45,24 @@ function sum() {}
 // Level 1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
-function averageNumbers() {}
+function averageNumbers(arrayNumber){
+  if(!arrayNumber.length){return null}
+  return sumNumbers(arrayNumber)/arrayNumber.length
+}
+
 
 
 // Level 2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
 
-function averageWordLength() { }
+function averageWordLength(array) { 
+  if(!array.length){return null}
+  let sum1 = 0
+  for (let i=0; i<array.length; i++){
+    sum1 += array[i].length
+  }
+  return sum1/array.length
+}
 
 // Bonus - Iteration #4.1
 function avg() {}
@@ -52,16 +82,30 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
-
-
+function uniquifyArray(array) {
+  if(!array.length){return null}
+  let helperArray = []
+  for (let i=0; i<array.length; i++)
+    if (helperArray.includes(array[i]) === false){
+      helperArray.push(array[i])
+    }
+    return helperArray
+  }
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
-function doesWordExist() {}
-
-
+function doesWordExist(array) {
+  if(!array.length){return null}
+  const searchForThisWord = ""
+  for (let i=0; i<array.length; i++){
+    if (array[i] === searchForThisWord){
+      return true
+    } else {
+      return false
+    }
+  }
+}
 
 // Iteration #7: Count repetition
 const wordsCount = [
@@ -78,7 +122,15 @@ const wordsCount = [
   'matter'
 ];
 
-function howManyTimes() {}
+function howManyTimes(array, word) {
+  let count = 0 
+  for (let i=0; i< array.length; i++){
+    if (word === array[i]){
+      count++
+    }
+  }
+  return count 
+}