Initial commit

Author: Chris Bee

.gitignore

@@ -0,0 +1 @@
+01-random/codewars2.js

01-random/distance.js

@@ -0,0 +1,26 @@
+var distance = function (x1, y1, x2, y2) {
+  var xlen = 0;
+  var ylen = 0; 
+
+  if (x1 > x2){
+    xlen = x1 - x2;
+  } else {
+    xlen = x2 - x1;
+  }
+
+  if (y1 > y2) {
+    ylen = y1 - y2;
+  } else {
+    ylen = y2 - y1;
+  }
+
+  ylen = (ylen * (111.320 * Math.cos(x1 - xlen)) / 0.62137);
+  xlen = (xlen * 110.574) / 0.62137;
+  console.log(ylen, xlen);
+
+  return Math.sqrt(Math.pow(xlen,2) + Math.pow(ylen,2));
+
+}
+
+
+console.log(distance(37.7836966, -122.4089664, 37.7916655, -122.3952124));

01-random/primeNumbers.js

@@ -0,0 +1,84 @@
+///Gets prime numbers up to N///
+
+var Util = function () {
+    this.hash = {};
+    this.hash.count = 0;
+
+}
+
+Util.prototype.isPrime = function (num) {
+   for (var i = num - 1; i > 1; i--) {
+     if (num % i === 0) {
+       return false;
+     }
+   }
+   return true;
+ };
+
+ Util.prototype.createPrimes = function (n) {
+    for (var i = 2; i < n; i++) {
+      if(this.isPrime(i)){
+        this.hash[i] = i;
+        this.hash.count++;
+      }
+   }
+ }
+
+Util.prototype.getPrimes = function () {
+  return this.hash;
+}
+
+
+
+
+var Primes = {
+  first : function (n) {
+   var results = [];
+   var hash = {};
+   hash[2] = 2;
+
+
+   var isPrime = function (num) {
+     ////naive approach////
+     // for (var i = num - 1; i > 1; i--) {
+     //   if (num % i === 0) {
+     //     return false;
+     //   }
+     // }
+     // return true;
+
+     ////prime only approach///
+     for (var key in hash) {
+      if(num % key === 0) {
+        return false;
+      }
+     }
+     hash[num] = num;
+     console.log(hash);
+     return true;
+   };
+
+   var check = function (currNum) {
+     if(results.length === n) {
+      console.log("hit me");
+      return;
+     } else {
+
+
+        if(isPrime(currNum)) {
+          results.push(currNum);
+        } 
+        check(currNum + 1);
+     }    
+   } 
+
+   check(2);
+   return results;
+  }
+}
+
+
+
+console.log(Primes.first(266));
+
+

01-random/tictactoe.js

@@ -0,0 +1,84 @@
+//Determines if tic tac toe board is solved and who the winner is
+
+var isSolved = function (board) {
+
+  var m = new Moves();
+  var count = 0;
+
+  for (var i = 0; i < board.length; i++) {
+    for (var k = 0; k < board[i].length; k++) {
+      if(board[i][k] !== 0) {
+        var val = board[i][k];
+        count++;
+        //console.log(val, i, k);
+        //loop through moves, starting at current val
+          for (var mo = 0; mo < m.length; mo++) {
+            var movedCoords = m[mo]([i, k]); 
+            //console.log([i, k], movedCoords);
+            if(movedCoords && board[movedCoords[0]][movedCoords[1]] === val) {
+              var movedCoords2 = m[mo](movedCoords); 
+              if(movedCoords2 && board[movedCoords2[0]][movedCoords2[1]] === val) {
+                  return val;
+              }
+            }
+          }
+      }
+    }
+  }
+  if(count <= 8) {
+    return -1;
+  }
+  return 0;
+}
+
+var Moves = function () {
+  var moves = [];
+
+  var moveRight = function (coords) {
+    var newCoords = [coords[0], coords[1]+1];
+    if (newCoords[0] > 2 || newCoords[1] > 2) {
+      newCoords = null;
+    }
+    return newCoords;
+  }
+
+  var moveDown = function (coords) {
+    var newCoords = [coords[0]+1, coords[1]];
+    if (newCoords[0] > 2 || newCoords[1] > 2) {
+      newCoords = null;
+    }
+    return newCoords;
+  }
+
+  var moveDiag = function (coords) {
+    var newCoords = [coords[0]+1, coords[1]+1];
+    if (newCoords[0] > 2 || newCoords[1] > 2) {
+      newCoords = null;
+    }
+    return newCoords;
+  }
+
+  var moveDiagBack = function (coords) {
+    var newCoords = [coords[0]+1, coords[1]-1];
+    if (newCoords[0] > 2 || newCoords[1] > 2 || newCoords[0] < 0 || newCoords[1] < 0) {
+      newCoords = null;
+    }
+    return newCoords;
+  }
+
+  moves.push(moveRight);
+  moves.push(moveDown);
+  moves.push(moveDiag);
+  moves.push(moveDiagBack);
+
+  return moves;
+
+}
+
+
+var testBoard =  [[0,2,1],
+                  [0,1,2],
+                  [1,2,1]];
+
+console.log(isSolved(testBoard));
+