CodeEval - String Substitution - working with brute force substring

Solution is working whilst using a brute force substring match.

It'll be interesting to see if the solution runtime improves if I use a
better substring match. Given the small alphabet size (2) I'll go for
KMP.
Interview - Knuth-Morris-Pratt - O(m+n) time implementation

Note this implementaiton is independent of the alphabet size.
Coding For Interviews - move to distinct folder
Coding for Interview - Bit Manipulation