all done but ironhack-labs#7

Author: andresvaz89

src/functions-and-arrays.js

@@ -1,38 +1,75 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
-
-
-
+function maxOfTwoNumbers(a, b) {
+  if (a > b) {
+    return a;
+  } else if (b > a) {
+    return b;
+  } else if (a === b) {
+    return a && b;
+  }
+}
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
-
-
+function findLongestWord(words) {
+  let hugeWord = '';
+  if (words.length === 0) {
+    return null;
+  } else if (words.length === 1) {
+    return words[0];
+  } else {
+    for (let i = 0; i < words.length; i++) {
+      if (words[i].length > hugeWord.length) {
+        hugeWord = words[i];
+      }
+    }
+  }
+  return hugeWord;
+}
 
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
-
-
+function sumNumbers(numbers) {
+  let totalSum = 0;
+  for (let i = 0; i < numbers.length; i++) {
+    totalSum += numbers[i];
+  }
+  return totalSum;
+}
 
 // Iteration #3.1 Bonus:
 function sum() {}
 
-
-
 // Iteration #4: Calculate the average
 // Level 1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
-function averageNumbers() {}
+function averageNumbers(numbersAvg) {
+  if (numbersAvg.length === 0) {
+    return null;
+  }
 
+  let totalSum = 0;
+  for (let i = 0; i < numbersAvg.length; i++) {
+    totalSum += numbersAvg[i];
+  }
+  return totalSum / numbersAvg.length;
+}
 
 // Level 2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
 
-function averageWordLength() { }
+function averageWordLength(wordsArr) {
+  if (wordsArr.length === 0) {
+    return null;
+  }
+  let totalSumOfLetters = 0;
+  for (let i = 0; i < wordsArr.length; i++) {
+    totalSumOfLetters += wordsArr[i].length;
+  }
+  return totalSumOfLetters / wordsArr.length;
+}
 
 // Bonus - Iteration #4.1
 function avg() {}
@@ -52,16 +89,27 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
-
-
+function uniquifyArray(wordsUnique) {
+  if (wordsUnique.length === 0) {
+    return null;
+  }
+}
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
-
-function doesWordExist() {}
-
-
+let givenArr;
+function doesWordExist(wordsFind, givenArr) {
+  for (let i = 0; i < wordsFind.length; i++) {
+    if (givenArr === wordsFind[i]) {
+      return true;
+    }
+  }
+  if (wordsFind.length === 0) {
+    return null;
+  } else {
+    return false;
+  }
+}
 
 // Iteration #7: Count repetition
 const wordsCount = [
@@ -77,10 +125,17 @@ const wordsCount = [
   'disobedience',
   'matter'
 ];
-
-function howManyTimes() {}
-
-
+let oneWordToSearch;
+
+function howManyTimes(wordsCount, oneWordToSearch) {
+  let counterOfWords = 0;
+  for (let i = 0; i < wordsCount.length; i++) {
+    if (oneWordToSearch === wordsCount[i]) {
+      counterOfWords++;
+    }
+  }
+  return counterOfWords;
+}
 
 // Iteration #8: Bonus
 const matrix = [
@@ -108,9 +163,6 @@ const matrix = [
 
 function greatestProduct() {}
 
-
-
-
 // The following is required to make unit tests work.
 /* Environment setup. Do not modify the below code. */
 if (typeof module !== 'undefined') {