From a31999d605753dc75b3c82b5e96bd7b0c8a3ccba Mon Sep 17 00:00:00 2001
From: Raul Tarampi <jezreeldagan2001@mail.com>
Date: Tue, 30 Jan 2024 00:44:05 +0100
Subject: [PATCH] done

---
 src/functions-and-arrays.js | 104 +++++++++++++++++++++++++++++++-----
 1 file changed, 92 insertions(+), 12 deletions(-)

diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
index 3a7dbec41..32d526252 100644
--- a/src/functions-and-arrays.js
+++ b/src/functions-and-arrays.js
@@ -1,24 +1,60 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
-
+function maxOfTwoNumbers(value1, value2) {
+  if (value1 > value2) {
+    return value1
+  }
+  else {
+    return value2
+  }
+}
 
 
 // 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];
+  }
+  else {
+    let longestWord = words[0];
+
+    for (let i = 1; 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;
+  }
+  else {
+    let sum = 0;
+
+    for (let i = 0; i < numbers.length; i++) {
+      sum += numbers[i]
+    }
+    return sum;
+  }
+}
 
 
 
 // Iteration #3.1 Bonus:
-function sum() {}
+function sum() { }
 
 
 
@@ -26,16 +62,41 @@ function sum() {}
 // Level 1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
-function averageNumbers() {}
+function averageNumbers(number) {
+
+  if (number.length === 0) {
+    return null;
+  }
+  else {
+    const sum = sumNumbers(number)
+    const average = sum / number.length
+    return average
+  }
+}
+
+
+
 
 
 // Level 2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
 
-function averageWordLength() { }
+function averageWordLength(number) {
+  if (number.length === 0) {
+    return null
+  }
+  else {
+    let totalLength = 0
+    for (let word of number) {
+      totalLength += word.length;
+    }
+    const average = totalLength / number.length
+    return average
+  }
+}
 
 // Bonus - Iteration #4.1
-function avg() {}
+function avg() { }
 
 // Iteration #5: Unique arrays
 const wordsUnique = [
@@ -52,14 +113,29 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
+function uniquifyArray(number) {
+  if (number.length === 0) {
+    return null;
+  }
+  const uniqueArray = Array.from(new Set(number));
+
+  return uniqueArray;
+}
 
 
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
-function doesWordExist() {}
+function doesWordExist() {
+  if (wordsFind.length === 0) {
+    return null
+  }
+  if (doesWordExist.length === 1) {
+    return null
+  }
+}
+
 
 
 
@@ -78,7 +154,8 @@ const wordsCount = [
   'matter'
 ];
 
-function howManyTimes() {}
+function howManyTimes() {
+}
 
 
 
@@ -106,7 +183,7 @@ const matrix = [
   [1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48]
 ];
 
-function greatestProduct() {}
+function greatestProduct() { }
 
 
 
@@ -128,3 +205,6 @@ if (typeof module !== 'undefined') {
     greatestProduct
   };
 }
+
+
+