Some reworked functions

Author: EnriqueBarba

starter-code/src/functions-and-arrays.js

@@ -1,12 +1,16 @@
 // Find the maximum
 
+/*
 function maxOfTwoNumbers(num1, num2) {
   if (num1 > num2) {
     return num1;
   } else {
     return num2;
   }
 }
+*/
+
+const maxOfTwoNumbers = (num1, num2) => num1> num2 ? num1 : num2
 
 // Finding Longest Word
 var words = [
@@ -40,25 +44,39 @@ function findLongestWord(wordsArray) {
 
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
+/*
 function sumArray(numsArray) {
   let result = 0;
   numsArray.forEach(function (number) {
     result += number;
   })
   return result;
 }
+*/
+
+const sumArray = numsArray => {
+  let result = 0;
+  numsArray.forEach(function (number) {
+    result += number;
+  })
+  return result;
+}
 
 // Calculate the Average
 
 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+/*
 function averageNumbers(numsArray) {
   if (numsArray.length !== 0) {
     return sumArray(numsArray) / numsArray.length;
   } else {
     return null;
   }
 }
+*/
+
+const averageNumbers = numsArray  => (numsArray.length !== 0 ) ? ( sumArray(numsArray)/numsArray.length ) : null
 
 // Array of Strings
 var wordsArr = [
@@ -74,13 +92,23 @@ var wordsArr = [
   'palace'
 ];
 
+/*
 function averageWordLength(wordsArray) {
   let arrayLengths = [];
   wordsArray.forEach(function (word) {
     arrayLengths.push(word.length);
   })
   return averageNumbers(arrayLengths);
 }
+*/
+
+const averageWordLength = wordsArray => {
+  let arrayLengths = [];
+  wordsArray.forEach(function (word) {
+    arrayLengths.push(word.length);
+  })
+  return averageNumbers(arrayLengths);
+}
 
 // Unique Arrays
 var wordsUnique = [
@@ -97,6 +125,7 @@ var wordsUnique = [
   'bring'
 ];
 
+/*
 function uniquifyArray(wordsArray){
   let arrayResult = [];
   wordsArray.forEach(function (word) {
@@ -106,6 +135,16 @@ function uniquifyArray(wordsArray){
   })
   return arrayResult;
 }
+*/
+const uniquifyArray = wordsArray  =>{
+  let arrayResult = [];
+  wordsArray.forEach(function (word) {
+    if (arrayResult.indexOf(word) === -1) {
+      arrayResult.push(word);
+    }
+  })
+  return arrayResult;
+}
 
 // Finding Elements
 var wordsFind = [
@@ -119,6 +158,7 @@ var wordsFind = [
   'disobedience'
 ];
 
+/*
 function doesWordExist(wordsArray, wordToFind) {
   let result = false;
   wordsArray.forEach(function (word) {
@@ -127,6 +167,17 @@ function doesWordExist(wordsArray, wordToFind) {
     }
   })
   return result;
+} 
+*/
+
+const doesWordExist = (wordsArray, wordToFind) => {
+  let result = false;
+  wordsArray.forEach(function (word) {
+    if (wordToFind === word) {
+      result = true;
+    }
+  })
+  return result;
 }
 
 // Counting Repetion
@@ -144,6 +195,7 @@ var wordsCount = [
   'matter'
 ];
 
+/*
 function howManyTimes(wordsArray, wordToSearch) {
   let result = 0;
   wordsArray.forEach(function (word) {
@@ -152,6 +204,17 @@ function howManyTimes(wordsArray, wordToSearch) {
     }
   })
   return result;
+} 
+*/
+
+const howManyTimes = (wordsArray, wordToSearch) => {
+  let result = 0;
+  wordsArray.forEach(function (word) {
+    if (word === wordToSearch) {
+      result++;
+    }
+  })
+  return result;
 }
 
 // Bonus Quest
@@ -179,14 +242,6 @@ var matrix = [
   [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
 ];
 
-/*
-function greatestProduct(matrix) {
-  let result = 0;
-
-  return result;
-}
-*/
-
 const greatestProduct = grid => {
   let maxProd = 0;
   for (let i = 0; i < grid.length; i++) {