Create Solutions.rb

unit_04/w10d02/morning_exercise/Solutions.rb

@@ -0,0 +1,132 @@
+# Morning Exercise
+
+##Let's Look at the Differences
+
+## Rewrite the following Javascript functions in Ruby
+
+### Get Name
+```javascript
+var getName = function () {
+  var name = prompt("what is your name?");
+  return name;
+};
+```
+
+###Reverse It
+```javascript
+var reverseIt = function () {
+  var string = "a man, a plan, a canal, frenemies!";
+
+  var reverse = "";
+
+  for (var i=0; i < string.length; i++) {
+    reverse += string[string.length - (i+1)];
+  };
+
+  alert(reverse);
+};
+```
+###Swap Em
+```javascript
+var swapEm = function () {
+  var a = 10;
+  var b = 30;
+  var temp;
+
+  temp = b;
+  b = a;
+  a = temp;
+
+  alert("a is now " + a + ", and b is now " + b);
+};
+```
+###Multiply Array
+```javascript
+var multiplyArray = function (ary) {
+  if (ary.length == 0) { return 1; };
+
+  var total = 1;
+  // var total = ary[0];
+
+  for (var i=0; i < ary.length; i++) {
+    total = total * ary[i];
+  };
+
+  return total;
+};
+```
+### Fizz Buzzer
+```javascript
+var fizzbuzzer = function(x){
+  if( x%(3*5) == 0 ) {
+    return 'fizzbuzz'
+  } else if( x%3 == 0 ) {
+    return 'fizz'
+  } else if ( x%5 == 0 ) {
+    return 'buzz'
+  } else {
+    return 'archer'
+  }
+}
+```
+###Nth Fibonacci
+```javascript
+var nthFibonacciNumber = function () {
+  var fibs = [1, 1];
+  var num = prompt("which fibonacci number do you want?");
+
+  while (fibs.length < parseInt(num)) {
+    var length = fibs.length;
+    var nextFib = fibs[length - 2] + fibs[length - 1];
+    fibs.push(nextFib);
+  }
+
+  alert(fibs[fibs.length - 1] + " is the fibonacci number at position " + num);
+};
+```
+
+### Search Array
+``` javascript
+var searchArray = function(array,value) {
+  for(var i = 0; i < array.length-1; i++) {
+    if(array[i] == value) {
+      return true;
+      break;
+    }
+  }
+  return -1;
+};
+```
+
+### Palindrome
+Write a method that checks whether or not a string is a palindrome. 
+Here is the javascript:
+``` javascript
+var isPalindrome = function(str) {
+  for(var i = 0; i < str.length/2; i++){
+    if(str[i] != str[str.length-i-1]){
+      return false;
+      break;
+    }
+    return true;
+  }
+};
+```
+
+### hasDupes
+Write a method that checks whether or not an array has any duplicates. 
+Here is the javascript:
+``` javascript
+var hasDupes = function(arr){
+  var obj = {};
+  for (i = 0; i < arr.length; i++) {
+    if(obj[arr[i]]) {
+      return true;
+    }
+    else {
+      obj[arr[i]] = true;
+    }
+  }
+  return false;
+};
+```