Add simplified code

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
+
+*/

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);

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 + "$"));
+}
+*/

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');

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);
+}
+
+*/

Falsy Bouncer → Falsy Bouncer.js

@@ -1,10 +1,10 @@
 
 function bouncer(arr) {
- 
-  
- return arr.filter(Boolean);
-  
-  
+
+
+    return arr.filter(Boolean);
+
+
 }
 
 bouncer([7, "ate", "", false, 9]);

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;
+}
+
+*/

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"]);

Profile Lookup → 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";
-
-
 
 }