ironhack-labs · LexyV · Jan 23, 2018 · Jan 23, 2018
diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
@@ -1,4 +1,13 @@
 // Find the maximum
+function maxOfTwoNumbers(num1, num2){
+  if(num1 > num2){
+    return num1;
+  }else if(num1 < num2){
+    return num2;
+  }else{
+    return num1;
+  }
+  }

 // Finding Longest Word
 var words = [
@@ -10,14 +19,40 @@ var words = [
  'orchard',
  'crackpot'
 ];
-
+//1.create function
+function findLongestWord(array){
+  //2. create variables  
+  var longestWord;
+  var longestCount = 0;
+  for(var i=0; i < array.length; i++) {
+    if(array[i].length > longestCount){
+      longestWord = array[i];
+      longestCount = array[i].length;
+    }
+  }
+  return longestWord;
+}
 // Calculating a Sum

 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
-
+function sumArray(array){
+  var sum = 0;
+  for(i = 0; i < array.length; i++){
+    sum += array[i];
+  }
+  return sum;
+}
 // Calculate the Average

 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
+function averageNumbers(array){
+  if(array.length === 0){
+    return undefined;
+  }
+  sum = sumArray(array);
+  result = sum/array.length;
+  return result;
+}

 // Array of Strings
 var wordsArr = [
@@ -33,6 +68,19 @@ var wordsArr = [
  'palace'
 ];

+function averageWordLength(array){
+  if(array.length === 0){
+    return undefined;
+  }
+  var sumLengths = 0;
+  for(i = 0; i < array.length; i++){
+    sumLengths += array[i].length;
+  }
+  result = sumLengths / array.length;
+  return result;
+}
+
+
 // Unique Arrays
 var wordsUnique = [
  'crab',
@@ -47,6 +95,19 @@ var wordsUnique = [
  'simple',
  'bring'
 ];
+function uniquifyArray(array){
+  if(array.length === 0){
+    return undefined;
+  }
+  newArray = [];
+  for(i = 0; i < array.length; i++){
+    if(newArray.includes(array[i])){
+      continue;
+    }
+    newArray.push(array[i]);
+  }
+  return newArray;
+}

 // Finding Elements
 var wordsFind = [
@@ -60,6 +121,19 @@ var wordsFind = [
  'disobedience'
 ];

+function doesWordExist(array, array2){
+  if(array.length === 0){
+    return false;
+  }
+  if(array.includes(array2)){
+    return true;
+  }else{
+    return false;
+  }
+
+}
+
+
 // Counting Repetion
 var wordsCount = [
  'machine',
@@ -74,6 +148,19 @@ var wordsCount = [
  'disobedience',
  'matter'
 ];
+
+function howManyTimes(array, array2){
+  var sum = 0;
+  if(array.length === 0){
+    return false;
+  }
+  for(i = 0; i < array.length; i++){
+    if(array[i].includes(array2)){
+      sum +=1;
+    }
+  }
+  return sum;
+}
 // Bonus Quest

 var matrix = [
@@ -98,3 +185,28 @@ var matrix = [
  [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(array){
+  var numbers = 0;
+  var testing;
+    for (var i = 3; i < 20; i++){
+      for (var j = 0; j < 20; j++){
+        testing = array[i][j] * array[i-1][j] * array[i-2][j] * array[i-3][j]
+        if (numbers < testing)
+        {
+          numbers = testing
+        }
+      }
+    }
+    for (var i = 0; i < 20; i++){
+      for (var j = 3; j < 20; j++){
+        testing = array[j][i] * array[j-1][i] * array[j-2][i] * array[j-3][i]
+        if (numbers < testing)
+        {
+          numbers = testing
+        }
+      }
+    }
+    return numbers;
+  }
+