From 65b809566575b70f8d821f933be3247272397eee Mon Sep 17 00:00:00 2001
From: mrosas22 <miller.rosas22@gmail.com>
Date: Mon, 29 Oct 2018 21:44:34 -0400
Subject: [PATCH 1/3] Add solution 5

---
 .DS_Store                                | Bin 0 -> 8196 bytes
 starter-code/src/functions-and-arrays.js |  70 ++++++++++++++++++++++-
 2 files changed, 68 insertions(+), 2 deletions(-)
 create mode 100644 .DS_Store

diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..3c607dbc6490aba2421f692e162ce9e48f4cf4b4
GIT binary patch
literal 8196
zcmeHMU2IfE6h3DuaEHH6YoWcs!b(&AY@w9DRspx|f|ODrZc9rkl)HN`^v2tJ%ig=Y
zK&@$v_>-tnqwy~>F~k=@6CaE*KKV~HCdAYzF+Avtk4B@3PsTGdcL@}hH<g4t$;>x1
zXU@!=GvD0F*#!XX$eSAg>Ht8aERfHo;wDMRMZO`$!k!93Bz=GYEXY9<WWl>(bkq@f
zAo4)ufye`q2O<yL4j!O4TO_T_yRW2C8F?V`z#ZuU@qI{87MKiiQlb2GP$5GALJ<PU
zM0JV-q)sBlWQdarr7F#-q6Z9BF$^(Ksgpb*h7%@3oK&dP0hKynxH5(j3d+?<FCm8m
zCKX0y<blWoH+n!^pLyU@<Ze*per^12f|V)yV;RTG(3p#vF~|0U=H~A)Hlt$Ztl642
zN1HQ$&f)ZkS4;;+koP-`+#%80Zv-Qmu-@x=&egh+Ibd7GVP4bexq)H3R!%D0rbR=B
z`fb<riXC3wHGMfxS_w3bX>6F+j*o9{ZA@%wn`lgoZ)j=W*qGSb+&VGAwAzLZ+q;gA
zo;p4L$i$<sDibmMOhDx{lV7`)y^de#RQASRDcSo&$zI0h>Ro%f_YQNO_pOI4#|Z3#
zl`;a$ALf-l8Qzuk-2FMLKt}dwJtsfvlB6nYIN3Z6w%Q#hZJ)OMfxtQ$h}xj<<$_K*
zaKI*A(KpPih5o*=!1i4KfR*zJ89P63VSL5Pdzv@jdw*(b{(?%*s##5c!S?NpWAznn
zGZ;B&_*u&}ZTI*fInE92W44uJRk62OuWO82Q;TZrxV~6lT24#j_1Zu_W1q;|!Ko>}
zpmP4Q<vJTOY3DtjDP}YI`x=vy`sKQQNJu(!7L}%^sZFic*D`Ksy*^o@dYagJ#(mcN
zFrBXK(OcLijhn2`F*25;y0)@5jd!#Df-+ZiZeu&NDr{r}S#NZd?D6Hw$#z{oB39mO
z_`$w0%cWgiq~&>S-J+eetAj$;Zkl3GT77c0I)3Sa`ed_eaq-yb&<HzV7Yx#mRW20a
z8F&_+gV*6KoQL<|BlrTogs<RhxCEEsC-?<^gWur~_!Iud*;s>%uomm^ZfwGJxE@=v
z4e!Hk*p7R!8+-6UOydw9#$h~)$I!zu%%P9t_&A=yr|@Zf5#PXbcmdzRcku)K7(c;J
z@iY7ezr`Qb4r3+y_NaEL#4A)QdtHgX;dPB2xfy-qyB^q``d{dKd7j{GRrOsp3zyZe
zZfe=Ot^Mk;PCLzOX(f52h$0D8B8WWB>zFCntuJ1};(f$3>*VwsQQ|zGEf}Ru>BN?J
zBECW+?(neL5MQMc!Ff#1wPtOc@fpNrCY$TlvpAngwAEyD<0i&<1@T%*TiZxFix{k=
z+jo!@#LZ)JCDss6F^yw6K9*(UTW}6OgwKhGm*6|N0zbpA@E0+#0v8Yi>u?D!#W=3S
zRk#M%Vk2(GEg=_ExC?h<7x6KTeb|o!cn~va5*v@>2%aD|=COc9oW#e7lTYB2_&mNq
zynG2?#y9coG!}N1_@@vr+=_*Tbk21=_c)CyvG{uRsCAooV20X9orwQ;mjC_#HrZ{o
zjmQI$2mTEYU_~mO>Y$m+eXm8VouGV_vPfdwq(Z4eg$&0DWjIcF^$$a;Cupe9NrpJ7
Vka{Tn=RX8Q?|=0EOXl6##Xlwa@TC9%

literal 0
HcmV?d00001

diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index 2fcd81e6e..0276c2b8b 100644
--- a/starter-code/src/functions-and-arrays.js
+++ b/starter-code/src/functions-and-arrays.js
@@ -1,5 +1,13 @@
 // Find the maximum
 
+function maxOfTwoNumbers(num1, num2) {
+  if(num1 > num2)
+    return num1;
+  else
+    return num2;
+}
+
+maxOfTwoNumbers(25,22);
 // Finding Longest Word
 var words = [
   'mystery',
@@ -10,15 +18,45 @@ var words = [
   'orchard',
   'crackpot'
 ];
+function findLongestWord(words) {
+  if(words.length === 0){
+    return undefined
+  }
+  let longestWord = 0;
+  let longestName = "";
+  for(let i = 0; i < words.length; i++){
+    if(words[i].length > longestWord){
+  longestWord = words[i].length;
+  longestName = words[i];
+     }
+  }
+  
+  return longestName;
+  
+}
+// findLongestWord(words);
 
 // Calculating a Sum
-
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-// Calculate the Average
+function sumArray(arr){
+  let sumNumbers=0;
+  for (i=0; i<arr.length; i++){
+    sumNumbers += arr[i];
+  }
+  
+  return sumNumbers;
+}
 
+// Calculate the Average
 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+function averageNumbers(arr){
+  let sumLength= sumArray(arr);
+  let sumAverage= sumLength/arr.length;
+  return sumAverage;  
+}
+
 // Array of Strings
 var wordsArr = [
   'seat',
@@ -32,6 +70,19 @@ var wordsArr = [
   'fuel',
   'palace'
 ];
+function averageNumbers(wordsArr){
+  if(wordsArr.length === 0){
+    return undefined
+  }
+  let lengthAverage=0;
+  let averageWordsArr=0;
+  for (i=0; i<wordsArr.length; i++){
+    lengthAverage += wordsArr[i].length; 
+  }
+  averageWordsArr=(lengthAverage/(wordsArr.length));
+
+  return Math.ceil(averageWordsArr);
+}
 
 // Unique Arrays
 var wordsUnique = [
@@ -47,7 +98,22 @@ var wordsUnique = [
   'simple',
   'bring'
 ];
+function uniquifyArray(myArray){
+//Step 1 Iterate throught the array
+//Step 2 Create an empty array
+//Step 3 Compare the array with the empty array
 
+let i=0;
+while (i < (wordsUnique.length-1)){
+  let j=0
+ for (let i=j; i<wordsUnique.length; i++){
+  if (wordsUnique[i]===wordsUnique[i+1]){
+    var removedItem = wordsUnique.splice((i+1), 1);
+  }
+ }
+ j=j+1;
+}
+}
 // Finding Elements
 var wordsFind = [
   'machine',

From d71d81eb87da305fa2e3cd57cb05fc55a8e883fa Mon Sep 17 00:00:00 2001
From: mrosas22 <miller.rosas22@gmail.com>
Date: Tue, 30 Oct 2018 18:11:32 -0400
Subject: [PATCH 2/3] Added solution 7,8 pending 6 and bonus

---
 .DS_Store                                | Bin 8196 -> 8196 bytes
 starter-code/src/functions-and-arrays.js |  64 ++++++++++++++++-------
 2 files changed, 45 insertions(+), 19 deletions(-)

diff --git a/.DS_Store b/.DS_Store
index 3c607dbc6490aba2421f692e162ce9e48f4cf4b4..c3df2e669110087ebd0be2886ae325ceeab06368 100644
GIT binary patch
literal 8196
zcmeHMO>Epm6n<}$Hny9R*^)NyCX|H`nx;v+N!lhUY1#a>jY?@?^Vc@8@vco{;n?Zg
zyJ-?qErMhD6aPX;2=OBk5T|nBQf~Bs1c*u$4qOm$;KG#yf;S#-)Fw>@7oe&~n)$}_
z-rJe^{Mn=D1pw^L>#YDP07z6hvJKQ+r*J#3t4bsoDJMjV2k^jv9JD|doK@c8K*&JI
zK*&JIK*&JI!2f{(I<t9^);RZtHEcr$LI!S02Kf6SPL*Raz@k9^)j^G)0ub^Pz%SIN
zJiw2M2bc`7D9{h3-xS#c2B8?F7%0NY9_Q|a$pDK2ML3`c2MlJ$AVWcac8ZJp?tn>w
zVH+|KGO(Hf{`gdaOPRYynfulGyADQX)}6^%PKJCgWo9hX^%9A1F;Z5(ZheI$DUz~L
zc_cOE%%(ie%e%c=?i9Zo(!8lm&>wajYq_swMonWj&8qtx+tW<j$oavhZjj5wm}%?I
zY_F5Ib=Uu$lrTt=EXiqBv#_wYvpK%6Yq2@L(At)0Z;p2)Iu{pZsivXzz~JQc-2B25
zi|1YwTg2cs0aYuu{Q8adYq^C!vEN9pwBIYG{mRM)^-%P%l4hF<w2k94p6S@`sF8CC
z)2zy+tq*1$dnjjc`&ibo^3%4PX3?x>W%HKi89kPjGUp9<+%wL4ym!)da$cYBIBrrb
zA4@Zqca4V)3NQ;sKZUsr<)zBau{-M<TiQChdoFLht%^lADauJ=$o9;~Od~fkYwF(A
z3C+zKwr<*|#|oxvW-Mda)~1bU<Xu_zqqfwj>Uch5p2?fu9IKZkf3&tvRVH+r>6oMQ
zU(?wIN%+U>RP_|M^yLg{^&sG$22~k$X|YTT9CtJ+%JAcK3z-{CwQIMcj#yg8u$V53
zdD{0V>R3TA#*PMqon4ALo^__DX)A6Nn}gv42UYb^KJx>b>m8plY+BW&VESHK)d_Cv
z(RIEisXo~#?sI)IAv!XhCtG0`ogPPEg1$=4z#N>1XW=<`1Kxp;;R0NQ&*2OB625}3
z;d}TIeuAIj7x)eSfIkrsQNb-(gDT#I_hKXNz$R?RPTY_8VK)xoQ9OnZ;&B|uNz7mt
zb)3cm&fz>R;M4dbzKpNntN0dvfJ^uxeuSUkMX|6*NtuJ<y42!l)LZjOBxMFqVr1-k
z%8U(EANr4!`CX-u<L%X(x7Baonb^Dk{^i@b;s#!$v8!d}Ye|U37g0$hzIrc{Xt%~{
zl{-qBUa9pFlAUo@;@V*q!aE+jTOzqI$-h(@VzNw{7Pf|1lO(Z-u(ZT>%Oqk}CTwlW
z9*N}2)(LBe(j}9iS-G%wD+eXgEn6?FJxZU<A1wy|NPus{5`0SH`v$JS4<x)_Np!!H
z;3_cc3$7OHa2swX(KX>tY{7llfn6lLKI|vq9mXMi2vazWqnHlFXP}J^p1~Y?xQOSl
zh)?2Ecpjg@=kWy+<4gD^z9)pXEWaZq;R(d|ZzR7$DrZ}ceVTkq^1U`Zyt)Y)C=+W|
zdHz4J_V@praA)C?Lk2<y{w@Pp-k<94CGWM~?L60xQ=O#B3->Du^h2oOE_~ci#|fAJ
gFr<Dwuq6X53M31afBi#1EIj`?@8S8+S-5q}Utf*U>i_@%

literal 8196
zcmeHMU2IfE6h3DuaEHH6YoWcs!b(&AY@w9DRspx|f|ODrZc9rkl)HN`^v2tJ%ig=Y
zK&@$v_>-tnqwy~>F~k=@6CaE*KKV~HCdAYzF+Avtk4B@3PsTGdcL@}hH<g4t$;>x1
zXU@!=GvD0F*#!XX$eSAg>Ht8aERfHo;wDMRMZO`$!k!93Bz=GYEXY9<WWl>(bkq@f
zAo4)ufye`q2O<yL4j!O4TO_T_yRW2C8F?V`z#ZuU@qI{87MKiiQlb2GP$5GALJ<PU
zM0JV-q)sBlWQdarr7F#-q6Z9BF$^(Ksgpb*h7%@3oK&dP0hKynxH5(j3d+?<FCm8m
zCKX0y<blWoH+n!^pLyU@<Ze*per^12f|V)yV;RTG(3p#vF~|0U=H~A)Hlt$Ztl642
zN1HQ$&f)ZkS4;;+koP-`+#%80Zv-Qmu-@x=&egh+Ibd7GVP4bexq)H3R!%D0rbR=B
z`fb<riXC3wHGMfxS_w3bX>6F+j*o9{ZA@%wn`lgoZ)j=W*qGSb+&VGAwAzLZ+q;gA
zo;p4L$i$<sDibmMOhDx{lV7`)y^de#RQASRDcSo&$zI0h>Ro%f_YQNO_pOI4#|Z3#
zl`;a$ALf-l8Qzuk-2FMLKt}dwJtsfvlB6nYIN3Z6w%Q#hZJ)OMfxtQ$h}xj<<$_K*
zaKI*A(KpPih5o*=!1i4KfR*zJ89P63VSL5Pdzv@jdw*(b{(?%*s##5c!S?NpWAznn
zGZ;B&_*u&}ZTI*fInE92W44uJRk62OuWO82Q;TZrxV~6lT24#j_1Zu_W1q;|!Ko>}
zpmP4Q<vJTOY3DtjDP}YI`x=vy`sKQQNJu(!7L}%^sZFic*D`Ksy*^o@dYagJ#(mcN
zFrBXK(OcLijhn2`F*25;y0)@5jd!#Df-+ZiZeu&NDr{r}S#NZd?D6Hw$#z{oB39mO
z_`$w0%cWgiq~&>S-J+eetAj$;Zkl3GT77c0I)3Sa`ed_eaq-yb&<HzV7Yx#mRW20a
z8F&_+gV*6KoQL<|BlrTogs<RhxCEEsC-?<^gWur~_!Iud*;s>%uomm^ZfwGJxE@=v
z4e!Hk*p7R!8+-6UOydw9#$h~)$I!zu%%P9t_&A=yr|@Zf5#PXbcmdzRcku)K7(c;J
z@iY7ezr`Qb4r3+y_NaEL#4A)QdtHgX;dPB2xfy-qyB^q``d{dKd7j{GRrOsp3zyZe
zZfe=Ot^Mk;PCLzOX(f52h$0D8B8WWB>zFCntuJ1};(f$3>*VwsQQ|zGEf}Ru>BN?J
zBECW+?(neL5MQMc!Ff#1wPtOc@fpNrCY$TlvpAngwAEyD<0i&<1@T%*TiZxFix{k=
z+jo!@#LZ)JCDss6F^yw6K9*(UTW}6OgwKhGm*6|N0zbpA@E0+#0v8Yi>u?D!#W=3S
zRk#M%Vk2(GEg=_ExC?h<7x6KTeb|o!cn~va5*v@>2%aD|=COc9oW#e7lTYB2_&mNq
zynG2?#y9coG!}N1_@@vr+=_*Tbk21=_c)CyvG{uRsCAooV20X9orwQ;mjC_#HrZ{o
zjmQI$2mTEYU_~mO>Y$m+eXm8VouGV_vPfdwq(Z4eg$&0DWjIcF^$$a;Cupe9NrpJ7
Vka{Tn=RX8Q?|=0EOXl6##Xlwa@TC9%

diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index 0276c2b8b..aa93ca1ab 100644
--- a/starter-code/src/functions-and-arrays.js
+++ b/starter-code/src/functions-and-arrays.js
@@ -8,6 +8,7 @@ function maxOfTwoNumbers(num1, num2) {
 }
 
 maxOfTwoNumbers(25,22);
+
 // Finding Longest Word
 var words = [
   'mystery',
@@ -53,7 +54,7 @@ var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
 function averageNumbers(arr){
   let sumLength= sumArray(arr);
-  let sumAverage= sumLength/arr.length;
+  let sumAverage= (sumLength/arr.length);
   return sumAverage;  
 }
 
@@ -84,8 +85,9 @@ function averageNumbers(wordsArr){
   return Math.ceil(averageWordsArr);
 }
 
+
 // Unique Arrays
-var wordsUnique = [
+var words = [
   'crab',
   'poison',
   'contagious',
@@ -97,23 +99,26 @@ var wordsUnique = [
   'communion',
   'simple',
   'bring'
-];
-function uniquifyArray(myArray){
-//Step 1 Iterate throught the array
-//Step 2 Create an empty array
-//Step 3 Compare the array with the empty array
-
-let i=0;
-while (i < (wordsUnique.length-1)){
-  let j=0
- for (let i=j; i<wordsUnique.length; i++){
-  if (wordsUnique[i]===wordsUnique[i+1]){
-    var removedItem = wordsUnique.splice((i+1), 1);
+  ];
+  function uniquifyArray(words){
+    count=words.length;
+  // let wordsNew = "";
+    let repeatWord="";
+    j=0;
+    while (j<count){
+      repeatWord=words[j];
+      for (let i=0; i<count; i++){
+        if (repeatWord === words[i+1]){
+          words.splice([i+1],1);
+          count=count-1;
+        } 
+      }
+      j=j+1; 
+    }
+    return(words);
   }
- }
- j=j+1;
-}
-}
+  uniquifyArray(words);
+
 // Finding Elements
 var wordsFind = [
   'machine',
@@ -125,6 +130,16 @@ var wordsFind = [
   'truth',
   'disobedience'
 ];
+let search = ""
+function doesWordExist (array, word) {
+  for (var i = 0 ; i < array.length; i++) {
+    if(word === array[i]) {
+      return true
+    }
+  }
+  return false;
+}
+
 
 // Counting Repetion
 var wordsCount = [
@@ -138,8 +153,19 @@ var wordsCount = [
   'matter',
   'truth',
   'disobedience',
-  'matter'
+  'matter',
 ];
+
+function howManyTimes (array, word) {
+  let count = 0;
+  for (let i = 0 ; i < array.length; i++) {
+    if(word === array[i] ) {
+      count = (count +1);
+    }
+  }
+  return count;
+}
+
 // Bonus Quest
 
 var matrix = [

From b27d119f7622e01848cbc84e4acb436d92d4c4c6 Mon Sep 17 00:00:00 2001
From: mrosas22 <miller.rosas22@gmail.com>
Date: Tue, 30 Oct 2018 19:57:20 -0400
Subject: [PATCH 3/3] Add solution 6

---
 starter-code/src/functions-and-arrays.js | 42 ++++++++++++------------
 1 file changed, 21 insertions(+), 21 deletions(-)

diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index aa93ca1ab..7ed123254 100644
--- a/starter-code/src/functions-and-arrays.js
+++ b/starter-code/src/functions-and-arrays.js
@@ -35,7 +35,6 @@ function findLongestWord(words) {
   return longestName;
   
 }
-// findLongestWord(words);
 
 // Calculating a Sum
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
@@ -100,24 +99,19 @@ var words = [
   'simple',
   'bring'
   ];
-  function uniquifyArray(words){
-    count=words.length;
-  // let wordsNew = "";
-    let repeatWord="";
-    j=0;
-    while (j<count){
-      repeatWord=words[j];
-      for (let i=0; i<count; i++){
-        if (repeatWord === words[i+1]){
-          words.splice([i+1],1);
-          count=count-1;
-        } 
+  function uniquifyArray(array){
+    if(array.length === 0){
+      return undefined
+    }  
+    let newArray = [];
+      for (let i=0; i<array.length; i++){
+        if(newArray.indexOf(array[i])=== -1){
+          newArray.push(array[i])
+        }
       }
-      j=j+1; 
-    }
-    return(words);
+    return newArray;
   }
-  uniquifyArray(words);
+
 
 // Finding Elements
 var wordsFind = [
@@ -156,16 +150,22 @@ var wordsCount = [
   'matter',
 ];
 
-function howManyTimes (array, word) {
+function howManyTimes(array, word){
   let count = 0;
-  for (let i = 0 ; i < array.length; i++) {
-    if(word === array[i] ) {
-      count = (count +1);
+  if (array.length === 0){
+    return false;
+  }
+  
+  for (let i=0; i < wordsCount.length; i++){
+    if (word === wordsCount[i]) {
+      count += 1;
+      
     }
   }
   return count;
 }
 
+
 // Bonus Quest
 
 var matrix = [