From 688c1c4780e776f55cdf23112bc0e44e94ae8287 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Tormod=20Flesj=C3=B8?= <tormod.flesjo@gmail.com>
Date: Tue, 8 Jan 2019 17:02:58 +0100
Subject: [PATCH 1/2] testing purposes

---
 starter-code/src/functions-and-arrays.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index 2fcd81e6e..17a23b66b 100644
--- a/starter-code/src/functions-and-arrays.js
+++ b/starter-code/src/functions-and-arrays.js
@@ -10,7 +10,7 @@ var words = [
   'orchard',
   'crackpot'
 ];
-
+// testing purposes
 // Calculating a Sum
 
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];

From 22bfc86aa0328c02146f714ee082da020eb6ae91 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Tormod=20Flesj=C3=B8?= <tormod.flesjo@gmail.com>
Date: Sun, 17 Mar 2019 22:50:48 +0100
Subject: [PATCH 2/2] instructor code

---
 starter-code/src/functions-and-arrays.js | 123 ++++++++++++++++++++++-
 1 file changed, 122 insertions(+), 1 deletion(-)

diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index 17a23b66b..a7f0d330a 100644
--- a/starter-code/src/functions-and-arrays.js
+++ b/starter-code/src/functions-and-arrays.js
@@ -1,4 +1,11 @@
 // Find the maximum
+function maxOfTwoNumbers (num1, num2){
+  if (num1 > num2) {
+    return num1
+  } else {
+    return num2
+  }
+}
 
 // Finding Longest Word
 var words = [
@@ -10,14 +17,45 @@ var words = [
   'orchard',
   'crackpot'
 ];
-// testing purposes
+function findLongestWord (list){
+  if (list.length === 0){
+    return 
+  } else {
+    var result = ""
+    for (var i=0; i<list.length ; i++){
+      if (list[i].length > result.length){
+        result = list[i]
+      }
+    }
+    return result
+  }
+}
 // Calculating a Sum
 
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
+function sumArray (list) {
+  if (list.length === 0){
+    return 0
+  } else {
+    var sum = 0
+    for (var i=0; i<list.length; i++){
+      sum += list[i]
+    }
+    return sum
+  }
+}
 
 // Calculate the Average
 
 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
+function averageNumbers(list){
+  if (list.length === 0){
+    return 
+  } else {
+    return sumArray(list)/list.length
+  }
+}
+    
 
 // Array of Strings
 var wordsArr = [
@@ -33,6 +71,18 @@ var wordsArr = [
   'palace'
 ];
 
+function averageWordLength(list){
+  if (list.length === 0){
+    return
+  } else {
+    var numLet = 0
+    for (var i = 0; i<list.length; i++){
+      numLet += list[i].length
+    }
+    return numLet/list.length
+  }
+}
+
 // Unique Arrays
 var wordsUnique = [
   'crab',
@@ -48,6 +98,23 @@ var wordsUnique = [
   'bring'
 ];
 
+function uniquifyArray(words){
+  if (words.length === 0){
+    return
+  } else {
+    var uniquelist = []
+    for (var i = 0; i<words.length; i++){
+      if (uniquelist.indexOf(words[i])===-1){
+        uniquelist.push(words[i])
+      }
+
+    }
+    return uniquelist
+  }
+
+
+}
+
 // Finding Elements
 var wordsFind = [
   'machine',
@@ -60,6 +127,21 @@ var wordsFind = [
   'disobedience'
 ];
 
+
+function doesWordExist(list,word){
+  if (list.length === 0){
+    return false
+  } else {
+    for (var i=0; i<list.length; i++){
+      if (word === list[i]){
+        return true
+      }
+    }
+    return false
+  }
+}
+
+
 // Counting Repetion
 var wordsCount = [
   'machine',
@@ -74,8 +156,25 @@ var wordsCount = [
   'disobedience',
   'matter'
 ];
+
+function howManyTimes(list,word){
+  var numRep = 0
+  if (list.length === 0){
+    return false
+  } else {
+    for (var i=0; i<list.length; i++){
+      if (word === list[i]){
+        numRep++
+      }
+    }
+    return numRep
+  }
+}
+
 // Bonus Quest
 
+
+
 var matrix = [
   [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],
@@ -98,3 +197,25 @@ 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 (matrix){
+  var max = 0
+
+
+  for (var i=0; i<matrix.length; i++){
+    for (var j=0; j<matrix[i].length-3; j++){
+      if((matrix[i][j]*matrix[i][j+1]*matrix[i][j+2]*matrix[i][j+3])>max){
+        max=(matrix[i][j]*matrix[i][j+1]*matrix[i][j+2]*matrix[i][j+3])
+      }
+    }
+  }
+
+  for (var i=0; i<matrix.length-3; i++){
+    for (var j=0; j<matrix[i].length; j++){
+      if((matrix[i][j]*matrix[i+1][j]*matrix[i+2][j]*matrix[i+3][j])>max){
+        max=(matrix[i][j]*matrix[i+1][j]*matrix[i+2][j]*matrix[i+3][j])
+      }
+    }
+  }
+  return max
+} 
\ No newline at end of file