[FTRMT052023] Pierre Docquin

src/functions-and-arrays.js

@@ -1,41 +1,162 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
+function maxOfTwoNumbers(a, b) {
+  if(a < b){
+    return b;
+  } else if(a > b){
+    return a ;
+  }else{
+    return a
+  }
+}
+maxOfTwoNumbers(8, 19);
 
 
 
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
 
+function findLongestWord(words){
+  let hugeWord = "";
+  let hugeWordLength = -1;
+
+  if (words.length === 0) {
+    return null;
+  }
+
+
+  words.forEach(function(word){
+
+    if(word.length > hugeWordLength){
+      hugeWordLength = word.length;
+      hugeWord = word;
+
+    }
+  });
+
+  return hugeWord
+}
+findLongestWord(words)
 
 
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
+function sumNumbers(numbers) {
+
+  let sum = 0;
+   numbers.forEach(function(value){
+     sum +=  value;
+   }); 
+
+    return sum;
+  }
+/*
 
+function sumNumbers(numbers) {
+
+let sum = 0;
+
+ for(let i = 0 ; i < numbers.length ; i++){
+
+  sum +=  numbers[i];
+
+ }
+  return sum
+}
+const result = sumNumbers(numbers);
+console.log(result);
+
+}*/
+
+sumNumbers(numbers)
 
 
 // Iteration #3.1 Bonus:
-function sum() {}
+
+const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10];
+
+function sum(words) {
+let wordsLength = 0;
+
+  if (words.length === 0) {
+    return 0;
+  }
+  let bool = true;
+
+  for(let i = 0; i < words.length ; i++){
+
+    if(typeof words[i] === 'number' || typeof words[i] === 'boolean'){
+
+      wordsLength += words[i]
+
+    } else if(typeof words[i] === 'string') {
+
+      wordsLength += words[i].length;
+
+    } else if(typeof words[i] === 'object'){
+
+      throw new Error("Unsupported data type sir or ma'am");
+     }
+  }
+
+  console.log(wordsLength);
+
+  return wordsLength
+ }
+ 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(numbers) {
+
+  if (numbers.length === 0) {
+    return null;
+  }
+  return sumNumbers(numbers) / numbers.length ;
+}
 
+const result = averageNumbers(numbersAvg);
+console.log(result)
 
 // Level 2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
 
-function averageWordLength() { }
+function averageWordLength(words) {
+  let wordsLength = 0;
+  let averageWords = 0;
+
+  if (words.length === 0) {
+    return null;
+  }
+
+  for(let i = 0; i < words.length ; i++){
+    wordsLength += words[i].length;
+  }
+  averageWords = wordsLength / words.length
+  return averageWords
+ }
+
+const result4 = averageWordLength(wordsArr);
+console.log(result4)
+
 
 // Bonus - Iteration #4.1
-function avg() {}
+
+function avg(numbers) {
+
+  if (numbers.length === 0) {
+    return null;
+  }
+
+  return sum(numbers) / numbers.length;
+
+}
+avg(mixedArr)
 
 // Iteration #5: Unique arrays
 const wordsUnique = [
@@ -52,15 +173,53 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
+uniquifyArray(wordsUnique, 'playground');
 
+function uniquifyArray(arrs){
+
+
+
+  if (arrs.length === 0) {
+    return null;
+  }
+
+  let newArrs = [];
+  let i = 0
+  for(let element of arrs){
+    if(!arrs.includes(element) == i){
+    newArrs.unshift(element);
+      i++
+
+  }else if (newArrs.includes(element)){
+    continue
+
+  } else if (arrs.includes(element)){
+      return arrs
+  }
+}
+  return newArrs
+}
 
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
-function doesWordExist() {}
+function doesWordExist(wordsUse, wordSearch) {
+  if (wordsUse.length === 0) {
+    return null;
+  }
+
+
+  for(let i = 0 ; i < wordsUse.length ; i++){
+    if(wordsUse[i] === wordSearch){
+
+    return  true;    
+    }
+ }
+   return  false; 
+}
 
+doesWordExist(wordsFind, 'starting');
 
 
 // Iteration #7: Count repetition
@@ -78,8 +237,22 @@ const wordsCount = [
   'matter'
 ];
 
-function howManyTimes() {}
+function howManyTimes(wordsUse, wordSearch) {
+  if (wordsUse.length === 0) {
+    return 0;
+  }
 
+  let count = 0;
+
+  for (let i = 0; i < wordsUse.length; i++) {
+    if (wordsUse[i] === wordSearch) {
+      count++;
+    }
+  }
+
+  return count;
+}
+howManyTimes(wordsCount, 'matter');
 
 
 // Iteration #8: Bonus
@@ -106,7 +279,12 @@ const matrix = [
   [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
 ];
 
-function greatestProduct() {}
+function greatestProduct() {
+  if (numbers.length === 0) {
+    return null;
+  }
+
+}