From 66f34a9b5f879f2a5e89ef0e934657f4b0c075c7 Mon Sep 17 00:00:00 2001
From: yuliu2016 <yuliu2016@users.noreply.github.com>
Date: Mon, 30 Oct 2017 22:45:42 -0400
Subject: [PATCH 1/2] Add JS Extensions

---
 Check for Palindromes => Check for Palindromes.js                 | 0
 Chunky Monkey => Chunky Monkey.js                                 | 0
 Confirm the Ending => Confirm the Ending.js                       | 0
 Counting Cards => Counting Cards.js                               | 0
 Factorialize a Number => Factorialize a Number.js                 | 0
 Falsy Bouncer => Falsy Bouncer.js                                 | 0
 ...ngest Word in a String => Find the Longest Word in a String.js | 0
 Mutations => Mutations.js                                         | 0
 Profile Lookup => Profile Lookup.js                               | 0
 ...a string repeat a string => Repeat a string repeat a string.js | 0
 ...rgest Numbers in Arrays => Return Largest Numbers in Arrays.js | 0
 Reverse a String => Reverse a String.js                           | 0
 Seek and Destroy => Seek and Destroy.js                           | 0
 Title Case a Sentence => Title Case a Sentence.js                 | 0
 14 files changed, 0 insertions(+), 0 deletions(-)
 rename Check for Palindromes => Check for Palindromes.js (100%)
 rename Chunky Monkey => Chunky Monkey.js (100%)
 rename Confirm the Ending => Confirm the Ending.js (100%)
 rename Counting Cards => Counting Cards.js (100%)
 rename Factorialize a Number => Factorialize a Number.js (100%)
 rename Falsy Bouncer => Falsy Bouncer.js (100%)
 rename Find the Longest Word in a String => Find the Longest Word in a String.js (100%)
 rename Mutations => Mutations.js (100%)
 rename Profile Lookup => Profile Lookup.js (100%)
 rename Repeat a string repeat a string => Repeat a string repeat a string.js (100%)
 rename Return Largest Numbers in Arrays => Return Largest Numbers in Arrays.js (100%)
 rename Reverse a String => Reverse a String.js (100%)
 rename Seek and Destroy => Seek and Destroy.js (100%)
 rename Title Case a Sentence => Title Case a Sentence.js (100%)

diff --git a/Check for Palindromes b/Check for Palindromes.js
similarity index 100%
rename from Check for Palindromes
rename to Check for Palindromes.js
diff --git a/Chunky Monkey b/Chunky Monkey.js
similarity index 100%
rename from Chunky Monkey
rename to Chunky Monkey.js
diff --git a/Confirm the Ending b/Confirm the Ending.js
similarity index 100%
rename from Confirm the Ending
rename to Confirm the Ending.js
diff --git a/Counting Cards b/Counting Cards.js
similarity index 100%
rename from Counting Cards
rename to Counting Cards.js
diff --git a/Factorialize a Number b/Factorialize a Number.js
similarity index 100%
rename from Factorialize a Number
rename to Factorialize a Number.js
diff --git a/Falsy Bouncer b/Falsy Bouncer.js
similarity index 100%
rename from Falsy Bouncer
rename to Falsy Bouncer.js
diff --git a/Find the Longest Word in a String b/Find the Longest Word in a String.js
similarity index 100%
rename from Find the Longest Word in a String
rename to Find the Longest Word in a String.js
diff --git a/Mutations b/Mutations.js
similarity index 100%
rename from Mutations
rename to Mutations.js
diff --git a/Profile Lookup b/Profile Lookup.js
similarity index 100%
rename from Profile Lookup
rename to Profile Lookup.js
diff --git a/Repeat a string repeat a string b/Repeat a string repeat a string.js
similarity index 100%
rename from Repeat a string repeat a string
rename to Repeat a string repeat a string.js
diff --git a/Return Largest Numbers in Arrays b/Return Largest Numbers in Arrays.js
similarity index 100%
rename from Return Largest Numbers in Arrays
rename to Return Largest Numbers in Arrays.js
diff --git a/Reverse a String b/Reverse a String.js
similarity index 100%
rename from Reverse a String
rename to Reverse a String.js
diff --git a/Seek and Destroy b/Seek and Destroy.js
similarity index 100%
rename from Seek and Destroy
rename to Seek and Destroy.js
diff --git a/Title Case a Sentence b/Title Case a Sentence.js
similarity index 100%
rename from Title Case a Sentence
rename to Title Case a Sentence.js

From e3c06071d421eff3c54166b0a67d07451cd98a60 Mon Sep 17 00:00:00 2001
From: yuliu2016 <yuliu2016@users.noreply.github.com>
Date: Mon, 30 Oct 2017 23:26:17 -0400
Subject: [PATCH 2/2] Changed Some Codes

---
 Check for Palindromes.js             | 41 ++++++++++++++++++----------
 Chunky Monkey.js                     | 19 ++++++-------
 Confirm the Ending.js                | 30 ++++++++++----------
 Counting Cards.js                    | 32 +++++++++++-----------
 Factorialize a Number.js             | 28 ++++++++++++-------
 Falsy Bouncer.js                     | 10 +++----
 Find the Longest Word in a String.js | 41 +++++++++++++++++-----------
 Mutations.js                         | 38 +++++++++++++-------------
 Profile Lookup.js                    | 24 ++++++++--------
 Repeat a string repeat a string.js   | 33 ++++++++++------------
 Return Largest Numbers in Arrays.js  | 30 ++++++++++----------
 Reverse a String.js                  | 14 +++++-----
 Seek and Destroy.js                  | 18 ++++++------
 Title Case a Sentence.js             | 34 +++++++++++------------
 14 files changed, 205 insertions(+), 187 deletions(-)

diff --git a/Check for Palindromes.js b/Check for Palindromes.js
index 36ca12c..80f0bdc 100644
--- a/Check for Palindromes.js	
+++ b/Check for Palindromes.js	
@@ -1,21 +1,32 @@
 function palindrome(str) {
 
-  str=str.replace(/[^0-9a-z]/gi, '');
-    str=str.toLowerCase();
-  
-    var stringArr=[];
- var backwardString="";
-  
-  stringArr=str.split("");
-  stringArr=stringArr.reverse(); 
-backwardString=stringArr.join(""); 
-  
-  if (backwardString===str){
-  return true;
-} else {
-  return false;
-}
+    str = str.replace(/[^0-9a-z]/gi, '');
+    str = str.toLowerCase();
+
+    var stringArr = [];
+    var backwardString ="";
+
+    stringArr=str.split("");
+    stringArr=stringArr.reverse();
+    backwardString=stringArr.join("");
+
+    if (backwardString===str){
+        return true;
+    } else {
+        return false;
+    }
 
 }
 
 palindrome("eye");
+
+
+/*PP's solution:
+
+function palindrome(s) {
+return s == "" || (s.charAt(0) === s.charAt(s.length - 1) && palindrome(s.substring(1, s.length - 2)))
+}
+
+Note: it doesn't ignore special characters
+
+*/
diff --git a/Chunky Monkey.js b/Chunky Monkey.js
index 3207147..4ee5b3c 100644
--- a/Chunky Monkey.js	
+++ b/Chunky Monkey.js	
@@ -1,14 +1,13 @@
 function chunkArrayInGroups(arr, size) {
- var newArr=[];
-  var newSubArr=[];
-  
-  for (i=0;i<arr.length/size;i++) {
-  newSubArr=arr.slice(size*i,size*i+size);
-    
-  newArr.push(newSubArr);
-    
-  }
-  return newArr;
+    var newArr = [];
+    var newSubArr = [];
+
+    for (i = 0; i < arr.length / size; i++) {
+        newSubArr = arr.slice(size * i, size * i + size);
+        newArr.push(newSubArr);
+    }
+
+    return newArr;
 }
 
 chunkArrayInGroups(["a", "b", "c", "d"], 2);
diff --git a/Confirm the Ending.js b/Confirm the Ending.js
index ba9c586..09c2a8b 100644
--- a/Confirm the Ending.js	
+++ b/Confirm the Ending.js	
@@ -1,18 +1,18 @@
 
 function confirmEnding(str, target) {
-var lengthStr=0;
-  var lengthTarget=0;
-  var newString="";
-  
-  lengthStr=str.length; 
-  lengthTarget=target.length;
-  
- 
-  newString=str.substr(str.length-lengthTarget, lengthTarget);
-  if (newString===target){
-    return true;
-  }
-return false; 
+    var lengthStr = 0;
+    var lengthTarget = 0;
+    var newString = "";
+
+    lengthStr = str.length;
+    lengthTarget = target.length;
+
+    newString = str.substr(str.length - lengthTarget, lengthTarget);
+
+    if (newString === target){
+        return true;
+    }
+    return false;
 }
 
 
@@ -21,8 +21,6 @@ confirmEnding("Bastian", "n");
 
 /*PP's solution:
 function confirmEnding(str, target) {
-
-  
-  return str.test(new RegEx(target + "$"));
+    return str.test(new RegEx(target + "$"));
 }
 */
diff --git a/Counting Cards.js b/Counting Cards.js
index 07167c2..5b2d6b0 100644
--- a/Counting Cards.js	
+++ b/Counting Cards.js	
@@ -1,22 +1,22 @@
 var count = 0;
 
 function cc(card) {
- 
- 
-  if (card>=2&&card<=6){
-     count++;
-  } else if (card>=7&&card<=9){
-    
-  } else {
-    count--;
-     
-  }
- 
-  if (count>0){
-    return  count+" "+ "Bet";
-  } else {
-      return count+" "+ "Hold";
-}
+
+
+    if (card>=2&&card<=6){
+        count++;
+    } else if (card>=7&&card<=9){
+
+    } else {
+        count--;
+
+    }
+
+    if (count>0){
+        return  count+" "+ "Bet";
+    } else {
+        return count+" "+ "Hold";
+    }
 
 }
 
diff --git a/Factorialize a Number.js b/Factorialize a Number.js
index c839d0a..3f1092f 100644
--- a/Factorialize a Number.js	
+++ b/Factorialize a Number.js	
@@ -1,15 +1,23 @@
 
 function factorialize(num) {
-  if (num===0){
-    return 1;
-  } else {
-  for (i=num-1;i>0;i--){
-    num=num*i; 
-    
-  }
-  
-  return num;
-  }
+    if (num===0){
+        return 1;
+    } else {
+        for (i=num-1;i>0;i--){
+            num=num*i;
+
+        }
+
+        return num;
+    }
 }
 
 factorialize(5);
+
+/*PP's solution:
+
+function factorialize(num) {
+    return num <= 0 ? 1 : num * factorialize(num - 1);
+}
+
+*/
diff --git a/Falsy Bouncer.js b/Falsy Bouncer.js
index 70ceb24..4b8368a 100644
--- a/Falsy Bouncer.js	
+++ b/Falsy Bouncer.js	
@@ -1,10 +1,10 @@
 
 function bouncer(arr) {
- 
-  
- return arr.filter(Boolean);
-  
-  
+
+
+    return arr.filter(Boolean);
+
+
 }
 
 bouncer([7, "ate", "", false, 9]);
diff --git a/Find the Longest Word in a String.js b/Find the Longest Word in a String.js
index 6a993d7..c64b1ad 100644
--- a/Find the Longest Word in a String.js	
+++ b/Find the Longest Word in a String.js	
@@ -1,20 +1,29 @@
 function findLongestWord(str) {
-  var length=0; 
-  var result=0;
-  var arr=[];
-  arr=str.split(" ");
-
-  for (i=0;i<arr.length;i++){
-    length=arr[i].length;
-   
-    if (length>result){
-      result=length;
-   }
-    
-  }
-return result; 
-        
- 
+    var length = 0;
+    var result = 0;
+    var arr = [];
+    arr = str.split(" ");
+
+    for (i = 0; i < arr.length; i++){
+        length = arr[i].length;
+
+        if (length > result){
+            result = length;
+        }
+
+    }
+    return result;
 }
 
 findLongestWord("The quick brown fox jumped over the lazy dog");
+
+
+/*PP's solution:
+
+function findLongestWord(str) {
+    max = 0;
+    for (i in str.split(" ")) if (max < i.length) max = i.length;
+    return max;
+}
+
+*/
diff --git a/Mutations.js b/Mutations.js
index 45fd24a..a9a8c1e 100644
--- a/Mutations.js
+++ b/Mutations.js
@@ -1,24 +1,24 @@
 function mutation(arr) {
-  var letterFirst="";
-  var letterSecond="";
-  var count=0;
-    
-  for (i=0;i< arr[1].length;i++){
-    count=0; 
-    letterFirst=arr[1].slice(i,i+1);
-    
-    for (j=0;j<arr[0].length;j++) {
-    letterSecond=arr[0].slice (j,j+1);
-   
-    if (letterSecond.toLowerCase()===letterFirst.toLowerCase()){
-      count++;
+    var letterFirst = "";
+    var letterSecond = "";
+    var count = 0;
+
+    for (i = 0; i< arr[1].length; i++){
+        count = 0;
+        letterFirst = arr[1].slice(i,i+1);
+
+        for (j = 0; j < arr[0].length; j++) {
+            letterSecond = arr[0].slice (j, j + 1);
+
+            if (letterSecond.toLowerCase() === letterFirst.toLowerCase()){
+                count++;
+            }
+        }
+        if(count === 0){
+            return false;
+        }
     }
-  }
-    if(count===0){
-    return false;
-  }
-  }
-return true;
+    return true;
 }
 
 
diff --git a/Profile Lookup.js b/Profile Lookup.js
index d9e95a5..cde063a 100644
--- a/Profile Lookup.js	
+++ b/Profile Lookup.js	
@@ -29,21 +29,19 @@ var name="";
 function lookUpProfile(firstName, prop){
 
 
-  for (i=0; i<contacts.length;i++){
-    name=contacts[i].firstName;
-    if (firstName===name){
-      if (contacts[i].hasOwnProperty(prop)){
-        return contacts[i][prop];
-      } else {
-        return "No such property";
-      }
-      
+    for (i = 0; i < contacts.length; i++){
+        name = contacts[i].firstName;
+        if (firstName === name){
+            if (contacts[i].hasOwnProperty(prop)){
+                return contacts[i][prop];
+            } else {
+                return "No such property";
+            }
+
+        }
+
     }
-   
-  }
     return "No such contact";
-  
-
 
 }
 
diff --git a/Repeat a string repeat a string.js b/Repeat a string repeat a string.js
index 85ba2b5..b78f603 100644
--- a/Repeat a string repeat a string.js	
+++ b/Repeat a string repeat a string.js	
@@ -1,30 +1,25 @@
 
 function repeatStringNumTimes(str, num) {
-  // repeat after me
-  var newString="";
-  if (num<=0){
-    return "";
-  }
-  
-  for (i=0;i<num;i++){
-    newString=newString+str;
-    
-  }
-  
-  
-  return newString;
+    // repeat after me
+    var newString = "";
+    if (num <= 0){
+        return "";
+    }
+
+    for (i = 0; i < num; i++){
+        newString = newString + str;
+
+    }
+
+    return newString;
 }
 
 repeatStringNumTimes("abc", 3);
 
 
 
-/*pp's solution: 
+/*PP's solution:
 function repeatStringNumTimes(str, num) {
-
-  
-  return num < 0 ? "" : str.repeat(num);
+    return num < 0 ? "" : str.repeat(num);
 }
-
-repeatStringNumTimes("abc", 3);
 */
diff --git a/Return Largest Numbers in Arrays.js b/Return Largest Numbers in Arrays.js
index 6eee5cd..c6db604 100644
--- a/Return Largest Numbers in Arrays.js	
+++ b/Return Largest Numbers in Arrays.js	
@@ -1,20 +1,20 @@
 function largestOfFour(arr) {
-  var number=0;
-  var result=0; 
-  var newArr=[];
-  for (i=0;i<arr.length;i++){
-    result=0;
-    for (j=0;j<arr[i].length;j++){
-   
-      number=arr[i][j];
-      
-      if(number>result){
-        result=number; 
-    
-      }
+    var number=0;
+    var result=0;
+    var newArr=[];
+    for (i=0;i<arr.length;i++){
+        result=0;
+        for (j=0;j<arr[i].length;j++){
+
+            number=arr[i][j];
+
+            if(number>result){
+                result=number;
+                
+            }
+        }
+        newArr[i]=result;
     }
-    newArr[i]=result;
-  }
 
     return newArr;
 }
diff --git a/Reverse a String.js b/Reverse a String.js
index 689514f..3073019 100644
--- a/Reverse a String.js	
+++ b/Reverse a String.js	
@@ -1,13 +1,13 @@
 function reverseString(str) {
 
-  var stringArr=[];
-  
- 
-  stringArr=str.split("");
-  stringArr=stringArr.reverse(); 
-  return stringArr.join(""); 
+    var stringArr=[];
 
 
-} 
+    stringArr=str.split("");
+    stringArr=stringArr.reverse();
+    return stringArr.join("");
+
+
+}
 
 reverseString("hello");
diff --git a/Seek and Destroy.js b/Seek and Destroy.js
index 8517a76..777ae5c 100644
--- a/Seek and Destroy.js	
+++ b/Seek and Destroy.js	
@@ -2,15 +2,15 @@
 function destroyer(arr) {
 
 	var newArray = Array.prototype.slice.call(arguments);
-  
-   for (i=0;i<newArray.length;i++){
-         for (j=0;j<arr.length;j++){
-    if (newArray[i]===arr[j]){
-        delete arr[j];
-        }
-         }
-  }
-return arr.filter(Boolean);
+
+	for (i=0;i<newArray.length;i++){
+		for (j=0;j<arr.length;j++){
+			if (newArray[i]===arr[j]){
+				delete arr[j];
+			}
+		}
+	}
+	return arr.filter(Boolean);
 }
 
 destroyer([3, 5, 1, 2, 2], 2, 3,5);
diff --git a/Title Case a Sentence.js b/Title Case a Sentence.js
index a2b9eb7..4a696e4 100644
--- a/Title Case a Sentence.js	
+++ b/Title Case a Sentence.js	
@@ -1,21 +1,21 @@
 function titleCase(str) {
-  var arr=[];
-  var word="";
-  var firstLetter="";
-  var newSentence="";
-  
-  str=str.toLowerCase();
-  arr=str.split(" ");
-  
-  for (i=0;i<arr.length;i++){
-    word=arr[i];
-    firstLetter=word.charAt(0).toUpperCase();
-    word=firstLetter+ word.substring(1);
-    arr[i]=word; 
-  }
-  
-  newSentence=arr.join(" ");
-  return newSentence;
+    var arr=[];
+    var word="";
+    var firstLetter="";
+    var newSentence="";
+
+    str=str.toLowerCase();
+    arr=str.split(" ");
+
+    for (i=0;i<arr.length;i++){
+        word=arr[i];
+        firstLetter=word.charAt(0).toUpperCase();
+        word=firstLetter+ word.substring(1);
+        arr[i]=word;
+    }
+
+    newSentence=arr.join(" ");
+    return newSentence;
 }
 
 titleCase("I'm a little tea pot");