Merge pull request careercup#1 from targunp/master

syncing changes

Author: kloncentaur8

.gitignore

@@ -0,0 +1,8 @@
+node_modules
+
+# Logs
+logs
+*.log
+
+# Mac specific
+DS_Store

README.md

@@ -1,22 +1,23 @@
-####Run the code and test
-This project uses Mocha and Chai for testing:
+# Cracking the Coding Interview 6th Edition - JavaScript
 
 <br>
-#####Install dependencies:
+
+## Install dependencies:
 ```bash
 npm install
-npm install -g mocha
-npm install -g chai
 ```
 
 <br>
-#####Run tests:
+
+## Test
+
 ```bash
-mocha --recursive
+npm test
 ```
 
-<br>
-#####Add new npm modules:
+If you just want to lint  
 ```bash
-npm install --save <package name>
+npm run lint
 ```
+
+<br>

lib/data-structures/chapter-1/1_3.js

@@ -0,0 +1,20 @@
+module.exports = Strings_1_3 = (function() {
+  return {
+    // Generate URL freindly strings of a specified length
+    // Solution #3 from the book.
+    // @param {String} s - Standard string with potential trailing whitespace
+    // @param {Number} l - The "true" length of the string
+    // @retuns {String} - A URL freindly string of the specified length
+    URLify: function(s, l) {
+      var newString = '';
+      for (var i = 0; i < l; i++) {
+        if (s.charAt(i) === ' '){
+          newString += '%20';
+        }else{
+          newString += s.charAt(i);
+        }
+      }
+      return newString;
+    }
+  };
+}());

lib/data-structures/chapter-1/1_4.js

@@ -6,7 +6,7 @@ module.exports = Strings1_4 = (function() {
     // @retuns {Boolean} - true if a permutation of palindrome exists, false if it does not
     palindromePermutation: function(str){
       var distinct = 0;
-      var s_array  = Array.apply(null, Array(256)).map(Number.prototype.valueOf, 0);
+      var s_array = Array.apply(null, Array(256)).map(Number.prototype.valueOf, 0);
       str = str.toLowerCase();
       for(var i = 0; i < str.length; i++){
         if(str[i] == ' '){
@@ -21,5 +21,5 @@ module.exports = Strings1_4 = (function() {
       }
       return (distinct < 2);
     }
-  }
+  };
 }());

lib/data-structures/chapter-1/1_8.js

@@ -1,15 +1,21 @@
 module.exports = Strings_1_8 = (function() {
-  var _isSubstring = function(str1, str2) {
-    return str1.indexOf(str2) != -1
-  }
-  var _sameLengthAndNotBlank = function(str1, str2) {
+  var isSubstring = function(str1, str2) {
+    return str1.indexOf(str2) != -1;
+  };
+
+  var sameLengthAndNotBlank = function(str1, str2) {
     var len = str1.length;
-    return len === str2.length && len > 0
-  }
+    return len === str2.length && len > 0;
+  };
+
   return {
     isRotation: function(str1, str2) {
-      if(!_sameLengthAndNotBlank(str1, str2)) return false;
-      if(_isSubstring(str1+str1, str2)) return true;
+      if(!sameLengthAndNotBlank(str1, str2)) {
+        return false;
+      }
+      if(isSubstring(str1+str1, str2)) {
+        return true;
+      }
     }
-  }
+  };
 }());

package.json

@@ -1,13 +1,17 @@
 {
   "name": "CrackingJS",
-  "version": "0.0.1",
+  "version": "0.0.2",
   "description": "Data Structures and Algorithms in Javascript",
+  "scripts": {
+    "lint": "eslint lib/**/*.js test/**/*.js",
+    "test": "npm run lint && mocha --recursive"
+  },
   "dependencies": {
-    "mocha": "*",
     "chai": "*",
+    "eslint": "^2.2.0",
+    "mocha": "*",
     "require-directory": "*",
     "sinon": "*"
   },
-  "devDependencies": {
-  }
+  "devDependencies": {}
 }

test/data-structures/chapter-1/1_3_Spec.js

@@ -0,0 +1,7 @@
+require('../../test_helper');
+describe('1.3 #URLify', function() {
+  it('returns a URL freindly string of the specified length', function() {
+    expect(Strings_1_3.URLify('much ado about nothing          ', 22)).to.be.equal('much%20ado%20about%20nothing');
+    expect(Strings_1_3.URLify('Mr John Smith       ', 13)).to.be.equal('Mr%20John%20Smith');
+  });
+});

test/test_helper.js

@@ -1,3 +1,3 @@
 require('../lib');
-module.exports = sinon = require("sinon");
-module.exports = expect = require("chai").expect
+module.exports = sinon = require('sinon');
+module.exports = expect = require('chai').expect;