From 03717d3dca5099030ebfdce70104895a204a579a Mon Sep 17 00:00:00 2001
From: JdeJ <jorgedjuana@gmail.com>
Date: Sun, 18 Nov 2018 19:52:23 +0100
Subject: [PATCH] done

---
 starter-code/.DS_Store                   | Bin 0 -> 8196 bytes
 starter-code/jasmine/.DS_Store           | Bin 0 -> 8196 bytes
 starter-code/src/functions-and-arrays.js | 158 +++++++++++++++++++++++
 3 files changed, 158 insertions(+)
 create mode 100644 starter-code/.DS_Store
 create mode 100644 starter-code/jasmine/.DS_Store

diff --git a/starter-code/.DS_Store b/starter-code/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..22bd113e67e88885987f25bccc31dc12a47dd679
GIT binary patch
literal 8196
zcmeHMO;8+F5bj<e%nT3)Br+syvIZzHSrih&DoHBKUjn5T6w7ZwH?uoq7@eJ2cV-s|
zqNwqfO0>#@KjlSJ<xf0md9mVIs`O$>mC=J2OFeke(u*hUH*c1TOLFj{R+v}yy5Dra
zo;Ur?x9`yd0N_Ag>jqE&K%maFTt(s*jrm#M)<V9ef;3V*fB_chsU;_yGPlhR3;_ZG
z0s#U60s#U60{;gD=*(tKxXroGy@3o62oTtj2(bMjLY?Wjuh+Tuwhj_r2|&7>%wD50
z)d5~i#Mg0OuXF8%(mi?gfPN_YB?j_v@<-To(s5s}bIrp6c{rfIGWrz?daF}h#G4Kn
z=Q@x90s#Ws5n#1@B|HHtIFPxyez#NP*+^wg!*RR1zQ#~ldBv_uK@h5h8sX8zqP>)G
zRX6VpsJVG|HLkjgDStd^+ve6-O-&p6Qc`Xhv@KUPEIsE18=6j27G?}fvzG?!yrntb
zeG=RuilQJU<;K<3p4hQyBo<qXMpk37u4ts^Xz$vZC^WWppBz1xS-G(K^x8A8^2E^J
z9H6!&(bu+TX*z|$l*zITWr|teC}t^2RmyO~X(=h!7wF-~vaVrU&a|F$NGIi5hY}u5
z+tzqaXa1SAZRRtUla%Yys+rE4s;l>#X2Q6jJF~97?6T2W$IiKf-o#mhVwo)|%Xvqi
z&?&$u=tC6d$S7W`-m~{WOGoFC*zx#g&F)%Rs+SsO3Wj5(Onqv}(A>p2)k*7?W?1LX
z5?+>TJZ|VYu@0l+q@`x`O?h{1&E1WPGMi5sPvs4FMQ#xUey?U_zbJn!ENHaaBeupO
zHP53oD+dK(p4kU;I!SJp+LU%tR)tB29+=<akQ5bVN1S|;ULFs<U+NZQO`I~-lx}iU
zkJKy34~a7cjv6=COMQYko3=9<dT58+PAaDac|&-NE&Q<RxMNw}qP1BH{mqIp$L#%@
zrfWpLmUst$wJq^3J`m~PXoCCbm>7Wt&>;&ea0xEM6?g-#!UymnT!+tK13rf@;7j-x
zzK0*+NB9YTfnVV__#F`?tiozk@E$yft=NW#@F@0RFUIf$4&!MY!BHH;S)9XpTtE#o
zXrYbE_#8fu7x6`W1>eMX@LhZl-^Y*eI)AKCk%}Yyx+w8e8kPLuh>G;V%%kGOt*96t
zY8d{HsQ67a<6m9<T@8Eox3nMbI@Wh;>+O}iu)h)NW)^wG;mq(DQ)C2ZDzUU_?>;F!
zMO@OCOW9pyy<Ew-Eo`#c2O{CH%oxKj#n!Myd=@=lM=SY4z9-sAo-(2?_jMnU!g2+%
zl*jePBuOqO8guXQ6Xe}Rgyr7&KJo%>LjQzuZ^1SAgxK~K+<@<hX+IOo{(wKR0&B4m
zo3I(fxF6f`UObFZ>?DpofDd9H4thL0gX1`XlQ@Obm_!xR#5J9`mc<-8=;9ha>v8S{
zyo8tW3ciFd<Lmf#3E$2XnZ`9<-Ojf{B4?Slb)Gzor4``P@5UkNXinNp(dNx#19@j7
zP{z|!Sp7eI`|tmEHV8p>0RlT50W2R%3=I$n#lKlf@d%M2Lj4?d*4VstuDuWvYznh`
j<v8iBe;Cp@;``#hUgw%T)c*Ak0m1nnoc|v4cDDEnvb)Xq

literal 0
HcmV?d00001

diff --git a/starter-code/jasmine/.DS_Store b/starter-code/jasmine/.DS_Store
new file mode 100644
index 0000000000000000000000000000000000000000..6c9447223aa0756cc41802e93283f3e9314e1020
GIT binary patch
literal 8196
zcmeHMO>h)N6n-y+&}|55B9P1?W+4Vsu#p6T<wtPy1B4$7WCKY64YNA~8J*08o!Kl9
zW2MBSfN}!$pyf$9S)~WdDt`_tg$Fsr60Gu|7mt>fR(Y~~-94L<pXFp}s+g|o{`%*=
z?tZVop02kG0N7o$IsuvhfKiqxYN@zOlH)Spk*cDeYC<G^00%s<p&i!3V|Pf$9kB;u
z55yjbJrH{!_P}iL0KM5Vu?p|L9*xV`1F;A0OApBJLz1$@OoUS!)u)3B6#@{-5I`lW
zQyidlk`ZPioYJUNX-*wIV5Evsh=E$2#*<Q<FcaaFMy(F0)d8cGF^W)7txkGLB@UR;
z7?-gJVh`Nu0eOAu;5jfMfYDpx_l*?8cjQXJSkCoxBy}}6<~l*x(eWKt&8ePSGmkM=
z%j(!O*%7~#4b89^ben}EvbEm~M{-fU-}l{_x|uuV*rj2ysK@t0)A8(rQg$qxM2-$P
zp5>Ri{i0_DYM!hf;G8o)EE*>!)}_~{lIiqhDmjr(cchZ*9^WuI$ysA-=hj`vMo*ua
zcwzFzOWH_`J`_-Yo6(o=ZLu4S_h^f&E|x96QMQ=#TBC2*?mfdo6a)K!?V6!8Zugp@
z9Sn>5fK1<&_r3iEdz{Q1$op<_)T5DwdDG1oN!adk-K=xQ4hBQ}R48kQ1HTaVD8WI8
zbY<VLXps8*#zM#Uf<ty8AmseY{Kd;wtX$o(e)G1T>AD5=f;aF*1LIEM<Xrn;$+5zb
zAv4I^p5=Ha4wLJ=&^hkd1-=kdyx%iN?dc_rO~ObR4^`4)qJ<3>bI!@46Q0&<G#ksg
z_>dj7X!lR~mYmU2BSy2)%GeRv-&3%uw5G*^`npHk4Bj7*6~bg(^`zQ4?|+`oRs>x4
zbgt#bLD$ULuCO>$LL1WD7#P>4iak;1mIiJN=Kax8G9{osX|$0sx|z7jo|OylHG^>9
znC;268=IE&HXFu}?C-KH+ai9pWZLxUEAv}29l9mtYhyqPw!scK40-z1ssyjVIXDlm
z!#i*V-iMFjOZW<|!PjsdZo-f7GyDp_!SC<~{Dt$7;R9HUO}HFaU<<Cnjkpz`#0+-f
zZrq1Y;{nX#QOu!*HXcVGOL!X3-~_&m=kPpUz)N@;-@rHV3Vwi};HUT*eva4h8@!?S
zS5@ZjUfnL2_&wF`aa)PI(QU07x*K;B+js2j`d_$vbG|&gg$)lbTKsTJTl?Dd6PcNV
zz3n9b$tXo6%@oC;GDFmH-bzWLwvkxMmsO(nK_Z}iipjem=1m*KmgZz4AtaTUYCh6R
z%_^cglh?%Hs}dw>GBHOr6Ki-UBesgUdUPG%z=_YIT90nxTNu$+)TpVpF6CSRkzFp+
z)tcY}8Lvdfid1|X-h+?e3nJll_!fSEpWqkx69H>b;1X=a1TMv8xDwlN6|Tk<uE#WP
z!p*n^dvQDN#6BWp7W?rK4&V@xF|Wutf+w+nAr^_0Q}_~|RiwOtui|TXkx2QLCff`J
z`^x0gi0=~KgM#DPg6I0)36d(4_|^&H)~xZs9KDk!8UJsu{QLi`*>Aj&*aNW#{(TQ%
zb#Jz}o93<b#g?&llJYUiGD*29jY@?I6^;|CaGY@F4@0UaNmS}&BAn7lJ(T|Q9|Gd{
MKYsre^X~8BZ(;uBZU6uP

literal 0
HcmV?d00001

diff --git a/starter-code/src/functions-and-arrays.js b/starter-code/src/functions-and-arrays.js
index 2fcd81e6e..6e1b04ba0 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 (numA, numB){
+  if(numA > numB){
+    return numA;
+  }else{
+    return numB;
+  }
+}
 
 // Finding Longest Word
 var words = [
@@ -11,14 +18,49 @@ var words = [
   'crackpot'
 ];
 
+function findLongestWord (arrWords){
+  let posMayor = 0;
+
+  for (let i = 1; i < arrWords.length; i++) {
+    if (arrWords[i].length > arrWords[posMayor].length){
+      posMayor = i;
+    }
+  }
+
+  return arrWords[posMayor];
+}
+
 // Calculating a Sum
 
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
+function sumArray (arrNumbers){
+  let acc = 0;
+
+  for (let i = 0; i < arrNumbers.length; i++) {
+    acc+=arrNumbers[i];
+  }
+
+  return acc;
+}
+
 // Calculate the Average
 
 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+function averageNumbers (arrNumbers){
+  let acc = 0;
+
+  if (arrNumbers.length != 0){
+    for (let i = 0; i < arrNumbers.length; i++) {
+      acc += arrNumbers[i];
+    }
+    return acc/arrNumbers.length;
+  }else{
+    return ;
+  }
+}
+
 // Array of Strings
 var wordsArr = [
   'seat',
@@ -33,6 +75,24 @@ var wordsArr = [
   'palace'
 ];
 
+function averageWordLength (arrWords){
+  let arrAux = [];
+
+  if (arrWords.length != 0){
+    for (let i = 0; i < arrWords.length; i++) {
+      arrAux[i] = arrWords[i].length;
+    }
+    let acc=0;
+    for (let i = 0; i < arrAux.length; i++) {
+      acc += arrAux[i];
+    }
+    return acc/arrAux.length;
+  }else{
+    return ;
+  }
+
+}
+
 // Unique Arrays
 var wordsUnique = [
   'crab',
@@ -48,6 +108,30 @@ var wordsUnique = [
   'bring'
 ];
 
+function uniquifyArray (arrWords){
+  let arrAux = [];
+
+  if (arrWords.length != 0){
+    arrAux.push(arrWords[0]);
+
+    for (let i = 1; i < arrWords.length; i++) {
+      let guardar = true;
+      for (let j = 0; j < arrAux.length; j++) {
+        if (arrWords[i] === arrAux[j]){
+          guardar = false;
+          break;
+        }
+      }
+      if(guardar){
+        arrAux.push(arrWords[i]);
+      }
+    }
+    return arrAux;
+  }else{
+    return ;
+  }
+}
+
 // Finding Elements
 var wordsFind = [
   'machine',
@@ -60,6 +144,23 @@ var wordsFind = [
   'disobedience'
 ];
 
+function doesWordExist (arrWords, word){
+
+  if (arrWords.length != 0){
+    let find = false;
+    for (let i = 0; i < arrWords.length; i++) {
+      if (arrWords[i] === word){
+        find = true;
+        break;
+      }
+    }
+    return find;
+  }else{
+    return false;
+  }
+
+}
+
 // Counting Repetion
 var wordsCount = [
   'machine',
@@ -74,6 +175,21 @@ var wordsCount = [
   'disobedience',
   'matter'
 ];
+
+function howManyTimes (arrWords, word){
+  let acc = 0;
+
+  if (arrWords.length != 0){
+    for (let i = 0; i < arrWords.length; i++) {
+      if (arrWords[i] === word){
+        acc++;
+      }
+    }
+    return acc;
+  }
+  return false;
+}
+
 // Bonus Quest
 
 var matrix = [
@@ -98,3 +214,45 @@ 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){
+  let greatestProduct = 0;
+
+  //calculo el mayor producto hacia adelante/atrás
+  for (let i = 0; i < matrix.length; i++) {
+    for (let j = 0; j < matrix[i].length-4; j++) {
+      let accumulator = 1;
+      let counter = 0;
+      let index = j;
+      while (counter < 4){
+        accumulator *= matrix[i][index];
+        index++;
+        counter++;
+      }
+      if(accumulator > greatestProduct){
+        greatestProduct = accumulator;
+      }
+    }
+    
+  }
+
+  //calculo el mayor producto hacia arriba/abajo
+  for (let i = 0; i < matrix[0].length; i++) {
+    for (let j = 0; j < matrix.length-4; j++) {
+      let accumulator = 1;
+      let counter = 0;
+      let index = j;
+      while (counter < 4){
+        accumulator *= matrix[index][i];
+        index++;
+        counter++;
+      }
+      if(accumulator > greatestProduct){
+        greatestProduct = accumulator;
+      }
+    }
+    
+  }
+
+  return greatestProduct;
+}
\ No newline at end of file