Added first test since it was a pain to debug, rewrite next highest number solution - closes #36 and #37. Adding testing and linting, will start adding tests for any new problems and wil go back and add tests as I have time.

Author: blakeembrey

.gitignore

@@ -1 +1,2 @@
 .DS_Store
+node_modules

.jshintignore

@@ -0,0 +1,4 @@
+node_modules
+
+# Pretty dodgy JS to keep it so small
+shortest-fizz-buzz

.jshintrc

@@ -0,0 +1,33 @@
+{
+  "node": true,
+  "browser": true,
+  "jquery": true,
+  "devel": true,
+  "nonstandard": true,
+  "worker": true,
+  "esnext": true,
+  "bitwise": false,
+  "boss": true,
+  "camelcase": true,
+  "curly": true,
+  "eqeqeq": true,
+  "eqnull": true,
+  "expr": true,
+  "forin": true,
+  "immed": true,
+  "latedef": true,
+  "newcap": true,
+  "noarg": true,
+  "quotmark": "single",
+  "regexp": true,
+  "strict": false,
+  "undef": true,
+  "unused": true,
+  "trailing": true,
+  "smarttabs": true,
+  "immed": true,
+  "globals": {
+    "it": true,
+    "describe": true
+  }
+}

Readme.md

@@ -1,3 +1,16 @@
 # Code Problems
 
-This repo is full of code problems that I have received prior or during an interview. I'll present all my solutions here in JavaScript, but feel free to add your own solutions in another language and even optimise my solutions. If you have your own code problems you would like to contribute, I would love to see them as well.
+This is my repo full of code problems that I have completed prior to or during an interview. I hope that all these problems (and solutions) are useful to practice against and review. Feel free to contribute any solutions and optimisations, given they are algorithmic optimisations. Please add your own problems that you find as well, as I would love to see them.
+
+## Contributing
+
+In lieu of a formal styleguide, take care to maintain the existing coding style. Add unit tests for any new or changed functionality.
+
+Lint and test your code using any means applicable, in JavaScript this means JSHint and Mocha which is run using Nodejs.
+
+## Testing
+
+```sh
+npm install # Installs `mocha` and any other dependencies needed to run
+npm test    # Runs the testing scripts
+```

anagram-detection/anagram-detection.js

@@ -61,7 +61,7 @@ var hashString = function (str) {
   }, 1);
 };
 
-var anagramDetection = function (parent, child) {
+module.exports = function (parent, child) {
   var length  = child.length,
       anagram = hashString(child),
       total   = 0;

array-pair-sum/array-pair-sum.js

@@ -1,5 +1,5 @@
 // This is just a modification of the integer difference problem presented elsewhere
-var arrayPairSum = function (k, array) {
+module.exports = function (k, array) {
   var hash  = {},
       pairs = [];
 

balanced-brackets/balanced-brackets.js

@@ -6,7 +6,7 @@ var brackets = {
 };
 
 // On each input string, process it using the balance checker
-var balancedBrackets = function (string) {
+module.exports = function (string) {
   var stack = [];
   // Process every character on input
   for (var i = 0; i < string.length; i++) {

binary-search-tree-check/binary-search-tree-check.js

@@ -1,4 +1,4 @@
-var isBinarySearchTree = function isBST (bst) {
+module.exports = function isBST (bst) {
   var test;
 
   // Break the recursion if the left or right node is bigger than the current

bubble-sort/bubble-sort.js

@@ -1,4 +1,4 @@
-var bubbleSort = function (array, compare) {
+module.exports = function (array, compare) {
   // Not an array, empty or array of 1 is already sorted
   if (!Array.isArray(array) || array.length < 2) {
     return array;

byte-string/byte-string.js

@@ -1,8 +1,8 @@
-var byteString = function (bytes, precision) {
+module.exports = function (bytes, precision) {
   var suffixes = ['B', 'KB', 'MB', 'GB', 'TB', 'PB', 'EB', 'ZB', 'YB'],
       factor   = Math.pow(10, precision > 0 ? precision : 2);
   // Using a for loop since it's perfect for this kind of problem
-  for (var i = bytes, k = 0; i >= 1024 && k < suffixes.length; i /= 1024, k++);
+  for (var i = bytes, k = 0; i >= 1024 && k < suffixes.length; i /= 1024, k++) {}
   // Return the number rounded to precision
   return (Math.round(i * factor) / factor) + ' ' + suffixes[k];
 };