w01 d01

challenges/bottles-of-beer-song.js

@@ -22,3 +22,27 @@
 */
 
 // YOUR CODE HERE
+
+function writeSong(a) {
+  for (var i = a; i > 0; i--){
+    if (i===1){
+      console.log (i + " bottle of beer on the wall")
+      console.log (i + " bottle of beer!")
+      console.log ("Take one down and pass it around,")
+    }
+    else {
+      console.log (i + " bottles of beer on the wall,")
+      console.log (i + " bottles of beer!")
+      console.log ("Take one down and pass it around,")
+    }
+    if (i === 1){
+      console.log ("No more bottles of beer on the wall...")
+    } else if (i === 2){
+      console.log (i-1 + " bottle of beer on the wall...")
+    } else {
+       console.log (i-1 + " bottles of beer on the wall...")
+    }
+    console.log("")
+  }
+}
+writeSong(5);

challenges/palindrome-detector.js

@@ -21,3 +21,54 @@
 */
 
 // YOUR CODE HERE
+function isPalindrome (n){
+    palindromeForward = n.split('');
+    palindromeInitial = palindromeForward;
+    palindromeReverse = n.split('');
+    reverse = palindromeReverse.reverse();
+    for (var i = 0; i < palindromeInitial.length; i++ ) {
+      if (palindromeForward[i]=== " "){
+        palindromeForward.splice(i,1);
+      }
+    }
+    for (var i = 0; i < palindromeInitial.length; i++ ) {
+      if (palindromeForward[i]=== ","){
+          palindromeForward.splice(i,1);
+      }
+    }
+    for (var i = 0; i < palindromeInitial.length; i++ ) {
+      if (palindromeForward[i]=== "."){
+          palindromeForward.splice(i,1);
+      }
+    }
+    for (var i = 0; i < palindromeInitial.length; i++ ) {
+      if (palindromeForward[i]=== ":"){
+          palindromeForward.splice(i,1);
+      }
+    }
+    for (var i = 0; i < palindromeReverse.length; i++ ) {
+      if (palindromeReverse[i]=== " "){
+        palindromeReverse.splice(i,1);
+      }
+    }
+    for (var i = 0; i < palindromeReverse.length; i++ ) {
+      if (palindromeReverse[i]=== ","){
+          palindromeReverse.splice(i,1);
+      }
+    }
+    for (var i = 0; i < palindromeReverse.length; i++ ) {
+      if (palindromeReverse[i]=== "."){
+          palindromeReverse.splice(i,1);
+      }
+    }
+    for (var i = 0; i < palindromeReverse.length; i++ ) {
+      if (palindromeReverse[i]=== ":"){
+          palindromeReverse.splice(i,1);
+      }
+    }
+    stringForward = palindromeForward.join('');
+    stringBackward = palindromeReverse.join('');
+    forward = stringForward.toLowerCase();
+    backward = stringBackward.toLowerCase();
+    return (forward === backward)
+}

challenges/primes.js

@@ -10,3 +10,21 @@
 */
 
 // YOUR CODE HERE
+function isPrime(num){
+  for(var i=2; i < num; i++){
+    if(num % i === 0) {
+      return false;
+    }
+  }
+  return num > 1;
+}
+function primes(max){
+  var primeArray = [];
+  for (var i=1; i <= max; i++){
+    isPrime(i);
+    if(isPrime(i)===true){
+        primeArray.push(i);
+    }
+  }
+  return primeArray;
+}