Moving problems into a subdirectory.

Author: blakeembrey

.gitmodules

@@ -1,3 +1,3 @@
-[submodule "test/cpp/gtest"]
-	path = test/cpp/gtest
+[submodule "tests/cpp/gtest"]
+	path = tests/cpp/gtest
 	url = [email protected]:tclamb/gtest.git

.jshintignore

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

CONTRIBUTING.md

@@ -1,5 +1,5 @@
-SHELL := /bin/sh
-TEST_DIR := test
+SHELL     := /bin/sh
+TEST_DIR  := tests
 GTEST_DIR := $(TEST_DIR)/cpp/gtest
 
 
@@ -32,8 +32,8 @@ all: .IGNORE
 
 
 # C++ build rules
+OTHER_SOURCES       := $(TEST_DIR)/cpp/common.cpp
 FUSED_GTEST_SOURCES := $(GTEST_DIR)/gtest-all.cc $(GTEST_DIR)/gtest_main.cc
-OTHER_SOURCES := $(TEST_DIR)/cpp/common.cpp
 CXXFLAGS += -DGTEST_HAS_PTHREAD=0 -DGTEST_HAS_TR1_TUPLE=0 -g
 CPP_OBJECTS := $(CPP_SOURCES:.cpp=.o)
 FUSED_GTEST_OBJECTS := $(FUSED_GTEST_SOURCES:.cc=.o)

Makefile

@@ -13,7 +13,8 @@
     "jshint": "~2.1.3"
   },
   "scripts": {
-    "test": "./node_modules/.bin/mocha test/javascript && ./node_modules/.bin/jshint ."
+    "lint": "./node_modules/.bin/jshint .",
+    "test": "npm run lint && ./node_modules/.bin/mocha tests/javascript"
   },
   "repository": {
     "type": "git",
@@ -27,7 +28,7 @@
   ],
   "author": "Blake Embrey",
   "license": "MIT",
-  "readmeFilename": "Readme.md",
+  "readmeFilename": "README.md",
   "bugs": {
     "url": "https://github.com/blakeembrey/code-problems/issues"
   }

Readme.md

@@ -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;

kth-largest-element-in-array/kth-largest-element-in-array.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 = [];
 

longest-words/Readme.md

@@ -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++) {

median-integer-stream/median-integer-stream.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

package.json

@@ -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;

anagram-detection/Readme.md renamed to problems/anagram-detection/Readme.md

@@ -1,4 +1,4 @@
-var combineTwoStrings = function (str1, str2, combined) {
+module.exports = function (str1, str2, combined) {
   // Generate all the posible paths between `str1` and `str2`
   var paths = {};
 

anagram-detection/anagram-detection.coffee renamed to problems/anagram-detection/anagram-detection.coffee

@@ -1,10 +1,5 @@
-// Elegant solution using built-in JavaScript functions
-var parseCSV = function (csv) {
-  return JSON.parse('[' + csv + ']');
-};
-
-// Crazy parser which was the original solution
-var parseCSV = function (csv) {
+// Please note: This can be accomplished using `JSON.parse('[' + csv + ']')`
+module.exports = function (csv) {
   var isNumber = false,
       isInput  = false,
       curr     = '',

anagram-detection/anagram-detection.js renamed to problems/anagram-detection/anagram-detection.js

@@ -1,4 +1,4 @@
-var evenOccuringElement = function (array) {
+module.exports = function (array) {
   var hash = {};
 
   // Loop though the array adding all the elements together in a hash

anagram-detection/anagram-detection.py renamed to problems/anagram-detection/anagram-detection.py

@@ -1,12 +1,12 @@
 // Implementing recursive solution
-var fibonacci = function (n) {
+exports.recursive = function fibonacci (n) {
   if (n in fibonacci) { return fibonacci[n]; }
   // Store the fibonacci values on the function itself
   return fibonacci[n] = (n < 2) ? n : fibonacci(n - 1) + fibonacci(n - 2);
 };
 
 // Implementing iterative solution
-var fibonacci = function (n) {
+exports.iterative = function fibonacci (n) {
   var results = [0, 1];
 
   if (n > 2) {
@@ -19,7 +19,7 @@ var fibonacci = function (n) {
 };
 
 // Implementing O(logn) matrix solution
-var fibonacci = function (n) {
+exports.matrix = function (n) {
   var memo = [0, [[0, 1], [1, 1]]];
 
   var matrixMultiply = function (A, B) {

array-pair-sum/Readme.md renamed to problems/array-pair-sum/Readme.md

@@ -1,7 +1,7 @@
 // Simple solution using a hash to look up numbers from the second array in the
 // first array. When the number doesn't exist in the hash - you know we have
 // found the missing number
-var findMissingElement = function (a, b) {
+exports.iterative = function (a, b) {
   var hash = {}, i;
 
   for (i = 0; i < b.length; i++) {
@@ -18,7 +18,7 @@ var findMissingElement = function (a, b) {
 
 // Bitwise solution using XOR to cancel each of the corresponding numbers out
 // with eachother until we end up with a number that isn't cancelled out
-var findMissingElement = function (a, b) {
+exports.bitwise = function (a, b) {
   var result = 0;
   a.concat(b).forEach(function (num) {
     result ^= num;
@@ -28,7 +28,7 @@ var findMissingElement = function (a, b) {
 
 // Maybe the simplest solution, but you can very easily add the two arrays and
 // take the result of `b` away from `a` to get the missing number
-var findMissingElement = function (a, b) {
+exports.sum = function (a, b) {
   var add = function (a, b) {
     return a + b;
   };

array-pair-sum/array-pair-sum.coffee renamed to problems/array-pair-sum/array-pair-sum.coffee

@@ -1,4 +1,4 @@
-var firstNonRepeatedCharacter = function (string) {
+module.exports = function (string) {
   var checkChar,
       prevCharacter;
 

array-pair-sum/array-pair-sum.js renamed to problems/array-pair-sum/array-pair-sum.js

@@ -1,10 +1,10 @@
 // Create a new flattened array
-var flatten = function (input) {
+exports.newArray = function flatten (input) {
   var output = [];
 
   for (var i = 0; i < input.length; i++) {
-    // Using Array.isArray for new browsers, in older browsers this can be
-    // polyfilled using `Object.prototype.toString.call(input[i]) === '[object Array]'`
+    // Using Array.isArray for new browsers, in older browsers this can be done
+    // using `Object.prototype.toString.call(input[i]) === '[object Array]'`
     if (Array.isArray(input[i])) {
       output.push.apply(output, flatten(input[i]));
     } else {
@@ -16,7 +16,7 @@ var flatten = function (input) {
 };
 
 // In place array flatten
-var flatten = function (array) {
+exports.inPlace = function (array) {
   var i = 0;
 
   while (i < array.length) {
@@ -31,7 +31,7 @@ var flatten = function (array) {
 };
 
 // Flatten array using ES5 reduce method
-var flatten = function (array) {
+exports.es5 = function flatten (array) {
   return array.reduce(function (arr, val) {
     return arr.concat(Array.isArray(val) ? flatten(val) : val);
   }, []);

balanced-brackets/Readme.md renamed to problems/balanced-brackets/Readme.md

@@ -1,4 +1,4 @@
-var getElementsByClassName = function (element, className) {
+exports.traversal = function (element, className) {
   var found = [];
 
   (function traverseDom (node) {
@@ -22,7 +22,7 @@ var getElementsByClassName = function (element, className) {
   return found;
 };
 
-var getElementsByClassName = function (element, className) {
+exports.regexp = function (element, className) {
   // This function takes an easier approach, using a regular expression and
   // getting all elements straight up using the asterisk selector
   var found    = [],