week1day2

src/functions-and-arrays.js

@@ -1,41 +1,140 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
+function maxOfTwoNumbers(num1,num2) {
+  if (num1 > num2) {
+    return num1;
+  } else {
+    return num2;
+  }
+}
+console.log(maxOfTwoNumbers(100,200))
+
 
 
 
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
+function findLongestWord(words) {
+  if (words.length === 0) {
+    return null;
+  }
+  else if (words.length === 1) {
+  return words[0]
+}
+  let longestWord = "";
+  for (let i = 0; i < words.length; i++) {
+    if (words[i].length > longestWord.length) {
+      longestWord = words[i];
+    }
+  }
+  return longestWord;
+}
+
 
 
 
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
+function sumNumbers(numbers) {
+  if (numbers.length === 0) {
+    return 0;
+  }
+  let sum = 0;
+  for (let i = 0; i < numbers.length; i++) {
+    sum += numbers[i];
+  }
+  if (sum === 0) {
+    return 0; 
+  }
+
+  return sum;
+}
 
 
 
 // Iteration #3.1 Bonus:
-function sum() {}
+const mixedArr = [6, 12, 'miami', 1, true, 'barca', '200', 'lisboa', 8, 10];
+
+function sum(mixedArr) {
+  if (mixedArr.length === 0) {
+    return 0;
+  } 
+  let totalSum = 0;
+    for (let i = 0; i < mixedArr.length; i++) {
+      if (typeof mixedArr[i] === 'number') {
+        totalSum += mixedArr[i];
+      } else if (typeof mixedArr[i] === 'string') {
+        totalSum += mixedArr[i].length;
+      } else if (typeof mixedArr[i] === 'boolean') {
+        if (mixedArr[i]) {
+          totalSum += 1;
+        }
+      }
+    }
+
+    return totalSum;
+  }
+
 
 
 
 // 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 avg = 0;
+let sum = 0;
+for (let i = 0; i < numbersAvg.length; i++) {
+  sum += numbersAvg[i];
+  avg = sum/numbersAvg.length;
+}
+return avg;
+}
 
 // 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;
+  } 
+  else {
+  let wordsAvg = 0;
+  let wordsLength = 0;
+  for (let i = 0; i < wordsArr.length; i++) {
+    wordsLength += wordsArr[i].length
+    wordsAvg = wordsLength/wordsArr.length
+  }
+  return wordsAvg;
+}
+}
 
 // Bonus - Iteration #4.1
-function avg() {}
+
+function avg(mixedArr) {
+  if (mixedArr.length === 0) {
+    return null;
+  } 
+  let arrSum = 0;
+    for (let i = 0; i < mixedArr.length; i++) {
+      if (typeof mixedArr[i] === 'number') {
+        arrSum += mixedArr[i];
+      } else if (typeof mixedArr[i] === 'string') {
+        arrSum += mixedArr[i].length;
+      } else if (typeof mixedArr[i] === 'boolean') {
+        if (mixedArr[i] === true) {
+          arrSum += 1;
+        }
+        arrAvg = arrSum/mixedArr.length 
+      }
+    }
+    return arrAvg;
+  }
 
 // Iteration #5: Unique arrays
 const wordsUnique = [
@@ -52,14 +151,33 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
-
+function uniquifyArray(wordsUnique) {
+  if (wordsUnique.length === 0) {
+    return null;
+  } 
+  else {
+    let simpleArr = [];
+    wordsUnique.forEach((word)=>{
+      if(simpleArr.includes(word) === false) {
+        simpleArr.push(word);
+      }
+    });
+return simpleArr;
+  }
+}
 
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
-function doesWordExist() {}
+function doesWordExist(wordsFind, word) {
+  if (wordsFind.length === 0) {
+    return null;
+  } 
+  else {
+    return wordsFind.includes(word);
+  }  
+  }
 
 
 
@@ -78,7 +196,18 @@ const wordsCount = [
   'matter'
 ];
 
-function howManyTimes() {}
+function howManyTimes(wordsCount, theWord) {
+if (wordsCount.length === 0) {
+  return 0;
+} 
+  let count = 0;
+  for (let i = 0; i < wordsCount.length; i++) {
+    if (wordsCount[i] === theWord) {
+      count++;
+    }
+  }
+  return count;
+}
 
 
 
@@ -106,7 +235,54 @@ const matrix = [
   [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
 ];
 
-function greatestProduct() {}
+
+// really hard!!!!!!!!
+
+function greatestProduct(matrix) {
+  let greatestProduct = 0;
+
+  for (let i = 0; i < matrix.length; i++) {
+    for (let j = 0; j < matrix[i].length - 3; j++) {
+      let product = matrix[i][j] * matrix[i][j+1] * matrix[i][j+2] * matrix[i][j+3];
+      if (product > greatestProduct) {
+        greatestProduct = product;
+      }
+    }
+  }
+
+
+  for (let i = 0; i < matrix.length - 3; i++) {
+    for (let j = 0; j < matrix[i].length; j++) {
+      let product = matrix[i][j] * matrix[i+1][j] * matrix[i+2][j] * matrix[i+3][j];
+      if (product > greatestProduct) {
+        greatestProduct = product;
+      }
+    }
+  }
+
+
+  for (let i = 0; i < matrix.length - 3; i++) {
+    for (let j = 0; j < matrix[i].length - 3; j++) {
+      let product = matrix[i][j] * matrix[i+1][j+1] * matrix[i+2][j+2] * matrix[i+3][j+3];
+      if (product > greatestProduct) {
+        greatestProduct = product;
+      }
+    }
+  }
+
+
+  for (let i = 3; i < matrix.length; i++) {
+    for (let j = 0; j < matrix[i].length - 3; j++) {
+      let product = matrix[i][j] * matrix[i-1][j+1] * matrix[i-2][j+2] * matrix[i-3][j+3];
+      if (product > greatestProduct) {
+        greatestProduct = product;
+      }
+    }
+  }
+
+  return greatestProduct;
+}
+