Exercise js day2 - Alejandro Diaz

Author: alxDiaz

.DS_Store

@@ -1,14 +1,23 @@
 // Find the maximum
 function maxOfTwoNumbers (first, second) {
-
+  if(first>= second){
+    return first;
+  }
+  else return second;
 }
 
 var largest = maxOfTwoNumbers(2, 6);
 console.log(largest);
 
 // Finding Longest Word
 function findLongestWord (words) {
-
+  var longestword = words[0];
+  for(var i= 1; i < words.length ; i++){
+    if(words[i].length > longestword.length){
+      longestword= words[i];
+    }
+  }
+  return longestword;
 }
 
 var words = [
@@ -25,7 +34,11 @@ console.log(longest);
 
 // Calculating a Sum
 function sumArray (array) {
-
+  var sum =0;
+  for(var i= 0; i < array.length ; i++){
+    sum+=array[i];
+  }
+  return sum;
 }
 
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
@@ -34,7 +47,7 @@ console.log(total);
 
 // Calculate the Average
 function averageNumbers (array) {
-
+ return sumArray(array)/ array.length ;
 }
 
 var numbers = [2, 6, 9, 10, 7, 4, 1, 9];
@@ -43,7 +56,11 @@ console.log(average);
 
 // Array of Strings
 function averageWordLength (array) {
-
+  var lengthSum = 0;
+  for(var i =0; i < array.length ;i++){
+    lengthSum+= array[i].length;
+  }
+  return lengthSum/array.length ;
 }
 
 var words = [
@@ -63,7 +80,13 @@ console.log(averageLength);
 
 // Unique Arrays
 function uniquifyArray (array) {
-
+  var uniqueArray = [];
+  for(var i = 0; i < array.length; i++){
+    if(uniqueArray.indexOf(array[i]) == -1){
+      uniqueArray.push(array[i]);
+    }
+  }
+  return uniqueArray;
 }
 
 var words = [
@@ -84,7 +107,12 @@ console.log(uniqued);
 
 // Finding Elements
 function doesWordExist (wordsArray, word) {
-
+  for(var i = 0; i < wordsArray.length; i++){
+    if(word === wordsArray[i]){
+        return true;
+    }
+  }
+  return false;
 }
 
 var words = [
@@ -106,7 +134,13 @@ console.log(hasDog);
 
 // Counting Repetion
 function howManyTimes (words, word) {
-
+  var howMany = 0;
+    for(var i = 0; i < words.length; i++){
+      if(word === words[i]){
+        howMany++;
+      }
+    }
+    return howMany;
 }
 
 var words = [
@@ -131,31 +165,66 @@ console.log(howManyDog);
 
 // Bonus Quest
 function greatestProduct (matrix) {
-
+var productFinal = 0;
+for(var i=0; i <matrix.length; i++){
+  for(j=0; j < matrix[i].length; j++){
+    var product;
+    if(i===0){
+          if(j===0){
+            product = matrix[i][j+1]* matrix[i+1][j]* matrix[i][matrix[i].length-1]* matrix[matrix.length-1][j];
+          }
+          else if (j===matrix[i].length-1){
+            product = matrix[i][j] * matrix[i][j-1] * matrix[i+1][j] *matrix[matrix.length-1][j];
+
+          }
+          else{
+            product = matrix[i][j-1]*matrix[i][j+1]*matrix[i+1][j]*matrix[matrix.length-1][j];
+          }
+    }else if (i===19){
+          if(j===0){
+            product = matrix[i-1][j]*matrix[i][j+1]*matrix[0][0]*matrix[i][matrix[i].length-1];
+          }
+          else if(j===19){
+            product = matrix[i][j-1] * matrix[i-1][matrix[i-1].length-1] * matrix[0][matrix[0].length-1]* matrix[i][0];
+          }
+          else{
+            product= matrix[i][j-1] * matrix[i][j+1] * matrix[i-1][j]* matrix[0][j];
+          }
+        }
+        else{
+            product = matrix[i][j-1]* matrix[i][j+1]*matrix[i+1][j]*matrix[i-1][j];
+          }
+          if(product>productFinal){
+            productFinal = product;
+          }
+        }
+  }
+return productFinal;
 }
 
 var matrix = [
-  [08,02,22,97,38,15,0,40,0,75,04,05,07,78,52,12,50,77,91,08],
-  [49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,04,56,62,0],
-  [81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,03,49,13,36,65],
-  [52,70,95,23,04,60,11,42,69,24,68,56,01,32,56,71,37,02,36,91],
+  [8,2,22,97,38,15,0,40,0,75,4,5,7,78,52,12,50,77,91,8],
+  [49,49,99,40,17,81,18,57,60,87,17,40,98,43,69,48,4,56,62,0],
+  [81,49,31,73,55,79,14,29,93,71,40,67,53,88,30,3,49,13,36,65],
+  [52,70,95,23,4,60,11,42,69,24,68,56,1,32,56,71,37,2,36,91],
   [22,31,16,71,51,67,63,89,41,92,36,54,22,40,40,28,66,33,13,80],
-  [24,47,32,60,99,03,45,02,44,75,33,53,78,36,84,20,35,17,12,50],
+  [24,47,32,60,99,3,45,2,44,75,33,53,78,36,84,20,35,17,12,50],
   [32,98,81,28,64,23,67,10,26,38,40,67,59,54,70,66,18,38,64,70],
-  [67,26,20,68,02,62,12,20,95,63,94,39,63,08,40,91,66,49,94,21],
-  [24,55,58,05,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72],
-  [21,36,23,09,75,0,76,44,20,45,35,14,0,61,33,97,34,31,33,95],
-  [78,17,53,28,22,75,31,67,15,94,03,80,04,62,16,14,09,53,56,92],
-  [16,39,05,42,96,35,31,47,55,58,88,24,0,17,54,24,36,29,85,57],
-  [86,56,0,48,35,71,89,07,05,44,44,37,44,60,21,58,51,54,17,58],
-  [19,80,81,68,05,94,47,69,28,73,92,13,86,52,17,77,04,89,55,40],
-  [04,52,08,83,97,35,99,16,07,97,57,32,16,26,26,79,33,27,98,66],
+  [67,26,20,68,2,62,12,20,95,63,94,39,63,8,40,91,66,49,94,21],
+  [24,55,58,5,66,73,99,26,97,17,78,78,96,83,14,88,34,89,63,72],
+  [21,36,23,9,75,0,76,44,20,45,35,14,0,61,33,97,34,31,33,95],
+  [78,17,53,28,22,75,31,67,15,94,3,80,4,62,16,14,9,53,56,92],
+  [16,39,5,42,96,35,31,47,55,58,88,24,0,17,54,24,36,29,85,57],
+  [86,56,0,48,35,71,89,7,5,44,44,37,44,60,21,58,51,54,17,58],
+  [19,80,81,68,5,94,47,69,28,73,92,13,86,52,17,77,4,89,55,40],
+  [4,52,8,83,97,35,99,16,7,97,57,32,16,26,26,79,33,27,98,66],
   [88,36,68,87,57,62,20,72,03,46,33,67,46,55,12,32,63,93,53,69],
-  [04,42,16,73,38,25,39,11,24,94,72,18,08,46,29,32,40,62,76,36],
-  [20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,04,36,16],
-  [20,73,35,29,78,31,90,01,74,31,49,71,48,86,81,16,23,57,05,54],
-  [01,70,54,71,83,51,54,69,16,92,33,48,61,43,52,01,89,19,67,48],
+  [4,42,16,73,38,25,39,11,24,94,72,18,8,46,29,32,40,62,76,36],
+  [20,69,36,41,72,30,23,88,34,62,99,69,82,67,59,85,74,4,36,16],
+  [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],
 ];
 
+
 var maxProduct = greatestProduct(matrix);
 console.log(maxProduct);