diff --git a/Check for Palindromes b/Check for Palindromes
deleted file mode 100644
index 36ca12c..0000000
--- a/Check for Palindromes	
+++ /dev/null
@@ -1,21 +0,0 @@
-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;
-}
-
-}
-
-palindrome("eye");
diff --git a/Check for Palindromes.js b/Check for Palindromes.js
new file mode 100644
index 0000000..80f0bdc
--- /dev/null
+++ b/Check for Palindromes.js	
@@ -0,0 +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;
+    }
+
+}
+
+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 b/Chunky Monkey
deleted file mode 100644
index 3207147..0000000
--- a/Chunky Monkey	
+++ /dev/null
@@ -1,14 +0,0 @@
-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;
-}
-
-chunkArrayInGroups(["a", "b", "c", "d"], 2);
diff --git a/Chunky Monkey.js b/Chunky Monkey.js
new file mode 100644
index 0000000..4ee5b3c
--- /dev/null
+++ b/Chunky Monkey.js	
@@ -0,0 +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;
+}
+
+chunkArrayInGroups(["a", "b", "c", "d"], 2);
diff --git a/Confirm the Ending b/Confirm the Ending
deleted file mode 100644
index ba9c586..0000000
--- a/Confirm the Ending	
+++ /dev/null
@@ -1,28 +0,0 @@
-
-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; 
-}
-
-
-confirmEnding("Bastian", "n");
-
-
-/*PP's solution:
-function confirmEnding(str, target) {
-
-  
-  return str.test(new RegEx(target + "$"));
-}
-*/
diff --git a/Confirm the Ending.js b/Confirm the Ending.js
new file mode 100644
index 0000000..09c2a8b
--- /dev/null
+++ b/Confirm the Ending.js	
@@ -0,0 +1,26 @@
+
+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;
+}
+
+
+confirmEnding("Bastian", "n");
+
+
+/*PP's solution:
+function confirmEnding(str, target) {
+    return str.test(new RegEx(target + "$"));
+}
+*/
diff --git a/Counting Cards b/Counting Cards
deleted file mode 100644
index 07167c2..0000000
--- a/Counting Cards	
+++ /dev/null
@@ -1,23 +0,0 @@
-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";
-}
-
-}
-
-cc(2); cc(3); cc(7); cc('K'); cc('A');
diff --git a/Counting Cards.js b/Counting Cards.js
new file mode 100644
index 0000000..5b2d6b0
--- /dev/null
+++ b/Counting Cards.js	
@@ -0,0 +1,23 @@
+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";
+    }
+
+}
+
+cc(2); cc(3); cc(7); cc('K'); cc('A');
diff --git a/Factorialize a Number b/Factorialize a Number
deleted file mode 100644
index c839d0a..0000000
--- a/Factorialize a Number	
+++ /dev/null
@@ -1,15 +0,0 @@
-
-function factorialize(num) {
-  if (num===0){
-    return 1;
-  } else {
-  for (i=num-1;i>0;i--){
-    num=num*i; 
-    
-  }
-  
-  return num;
-  }
-}
-
-factorialize(5);
diff --git a/Factorialize a Number.js b/Factorialize a Number.js
new file mode 100644
index 0000000..3f1092f
--- /dev/null
+++ b/Factorialize a Number.js	
@@ -0,0 +1,23 @@
+
+function factorialize(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 b/Falsy Bouncer.js
similarity index 61%
rename from Falsy Bouncer
rename to Falsy Bouncer.js
index 70ceb24..4b8368a 100644
--- a/Falsy Bouncer	
+++ 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 b/Find the Longest Word in a String
deleted file mode 100644
index 6a993d7..0000000
--- a/Find the Longest Word in a String	
+++ /dev/null
@@ -1,20 +0,0 @@
-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; 
-        
- 
-}
-
-findLongestWord("The quick brown fox jumped over the lazy dog");
diff --git a/Find the Longest Word in a String.js b/Find the Longest Word in a String.js
new file mode 100644
index 0000000..c64b1ad
--- /dev/null
+++ b/Find the Longest Word in a String.js	
@@ -0,0 +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;
+}
+
+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 b/Mutations
deleted file mode 100644
index 45fd24a..0000000
--- a/Mutations
+++ /dev/null
@@ -1,25 +0,0 @@
-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++;
-    }
-  }
-    if(count===0){
-    return false;
-  }
-  }
-return true;
-}
-
-
-mutation(["Mary", "Army"]);
diff --git a/Mutations.js b/Mutations.js
new file mode 100644
index 0000000..a9a8c1e
--- /dev/null
+++ b/Mutations.js
@@ -0,0 +1,25 @@
+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++;
+            }
+        }
+        if(count === 0){
+            return false;
+        }
+    }
+    return true;
+}
+
+
+mutation(["Mary", "Army"]);
diff --git a/Profile Lookup b/Profile Lookup.js
similarity index 72%
rename from Profile Lookup
rename to Profile Lookup.js
index d9e95a5..cde063a 100644
--- a/Profile Lookup	
+++ 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 b/Repeat a string repeat a string
deleted file mode 100644
index 85ba2b5..0000000
--- a/Repeat a string repeat a string	
+++ /dev/null
@@ -1,30 +0,0 @@
-
-function repeatStringNumTimes(str, num) {
-  // 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: 
-function repeatStringNumTimes(str, num) {
-
-  
-  return num < 0 ? "" : str.repeat(num);
-}
-
-repeatStringNumTimes("abc", 3);
-*/
diff --git a/Repeat a string repeat a string.js b/Repeat a string repeat a string.js
new file mode 100644
index 0000000..b78f603
--- /dev/null
+++ b/Repeat a string repeat a string.js	
@@ -0,0 +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;
+}
+
+repeatStringNumTimes("abc", 3);
+
+
+
+/*PP's solution:
+function repeatStringNumTimes(str, num) {
+    return num < 0 ? "" : str.repeat(num);
+}
+*/
diff --git a/Return Largest Numbers in Arrays b/Return Largest Numbers in Arrays
deleted file mode 100644
index 6eee5cd..0000000
--- a/Return Largest Numbers in Arrays	
+++ /dev/null
@@ -1,22 +0,0 @@
-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; 
-    
-      }
-    }
-    newArr[i]=result;
-  }
-
-    return newArr;
-}
-
-largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);
diff --git a/Return Largest Numbers in Arrays.js b/Return Largest Numbers in Arrays.js
new file mode 100644
index 0000000..c6db604
--- /dev/null
+++ b/Return Largest Numbers in Arrays.js	
@@ -0,0 +1,22 @@
+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;
+                
+            }
+        }
+        newArr[i]=result;
+    }
+
+    return newArr;
+}
+
+largestOfFour([[4, 5, 1, 3], [13, 27, 18, 26], [32, 35, 37, 39], [1000, 1001, 857, 1]]);
diff --git a/Reverse a String b/Reverse a String
deleted file mode 100644
index 689514f..0000000
--- a/Reverse a String	
+++ /dev/null
@@ -1,13 +0,0 @@
-function reverseString(str) {
-
-  var stringArr=[];
-  
- 
-  stringArr=str.split("");
-  stringArr=stringArr.reverse(); 
-  return stringArr.join(""); 
-
-
-} 
-
-reverseString("hello");
diff --git a/Reverse a String.js b/Reverse a String.js
new file mode 100644
index 0000000..3073019
--- /dev/null
+++ b/Reverse a String.js	
@@ -0,0 +1,13 @@
+function reverseString(str) {
+
+    var stringArr=[];
+
+
+    stringArr=str.split("");
+    stringArr=stringArr.reverse();
+    return stringArr.join("");
+
+
+}
+
+reverseString("hello");
diff --git a/Seek and Destroy b/Seek and Destroy
deleted file mode 100644
index 8517a76..0000000
--- a/Seek and Destroy	
+++ /dev/null
@@ -1,16 +0,0 @@
-
-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);
-}
-
-destroyer([3, 5, 1, 2, 2], 2, 3,5);
diff --git a/Seek and Destroy.js b/Seek and Destroy.js
new file mode 100644
index 0000000..777ae5c
--- /dev/null
+++ b/Seek and Destroy.js	
@@ -0,0 +1,16 @@
+
+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);
+}
+
+destroyer([3, 5, 1, 2, 2], 2, 3,5);
diff --git a/Title Case a Sentence b/Title Case a Sentence
deleted file mode 100644
index a2b9eb7..0000000
--- a/Title Case a Sentence	
+++ /dev/null
@@ -1,21 +0,0 @@
-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;
-}
-
-titleCase("I'm a little tea pot");
diff --git a/Title Case a Sentence.js b/Title Case a Sentence.js
new file mode 100644
index 0000000..4a696e4
--- /dev/null
+++ b/Title Case a Sentence.js	
@@ -0,0 +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;
+}
+
+titleCase("I'm a little tea pot");