From 9d8dbe7307a1a5f90f69b317f786e3a34f447275 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E2=80=9CGokce?= <gokceberndt@gmail.com>
Date: Fri, 12 May 2023 08:28:29 +0200
Subject: [PATCH] Solved 5 of them, ite. 2 and 5 are unsolved

---
 src/functions-and-arrays.js | 87 +++++++++++++++++++++++++++++++++----
 1 file changed, 78 insertions(+), 9 deletions(-)

diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
index 3a7dbec41..34f3cf2dd 100644
--- a/src/functions-and-arrays.js
+++ b/src/functions-and-arrays.js
@@ -1,20 +1,45 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
+function maxOfTwoNumbers(number1, number2) {
+  if (number1>number2){
+    return number1;
+  }
+  else if (number1<number2) {
+    return number2;
+  }
+  else {
+    return number1 || number2;
+  }
+}
+
 
 
 
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
+function findLongestWord(words) {
+  let wordY = '';
+  for (i = 0; i< words.length; i++) {
+    if (words[i].length >= wordY.length) {
+      return words[i];
+    }
+  }
+  return wordY;
+}
+// Does not seem to work:(((
 
 
 
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
+let sum = 0;
 
-function sumNumbers() {}
-
+function sumNumbers() {
+  for (let j = 0; j < numbers.length; j++) {
+    sum += numbers[j];
+  }
+  return sum;
+}
 
 
 // Iteration #3.1 Bonus:
@@ -26,13 +51,29 @@ function sum() {}
 // Level 1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
-function averageNumbers() {}
+
+let summed = 0;
+
+function averageNumbers() {
+  for (let x = 0; x < numbersAvg.length; x++) {
+    summed += numbersAvg[x];
+  }
+  return summed / numbersAvg.length;
+}
 
 
 // Level 2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
+let totalLetters = 0;
+
+function averageWordLength() { 
+  for (let y = 0; y< wordsArr.length; y++) {
+    totalLetters += wordsArr[y].length  
+  };
+  return totalLetters / wordsArr.length;
+}
+
 
-function averageWordLength() { }
 
 // Bonus - Iteration #4.1
 function avg() {}
@@ -52,14 +93,32 @@ const wordsUnique = [
   'bring'
 ];
 
-function uniquifyArray() {}
+function uniquifyArray() {
+
+}
+
+//Tried some stuff but it did not work:((
 
 
 
 // Iteration #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
 
-function doesWordExist() {}
+let word = '';
+
+function doesWordExist(anArray,word) {
+
+  for (let b = 0; b < wordsFind.length; b++) {
+    if (word === wordsFind[b]) {
+      return true;
+    }
+  }
+  return false;
+ }
+
+const res = doesWordExist(wordsFind, 'truth')
+console.log(res)
+
 
 
 
@@ -78,7 +137,17 @@ const wordsCount = [
   'matter'
 ];
 
-function howManyTimes() {}
+
+function howManyTimes(ArrX, wordX) {
+  let counter = 0;
+  for (let c = 0; c < wordsCount.length; c++) {
+    if (wordX === wordsCount[c]) {
+      counter ++; 
+    }
+  }
+  return counter;
+}
+