Tech ramblings

Recusive solution that uses O(n2) memory. A more memory effienct solution would use global state to flag which letters have been used while deeper in the call stack. I opted for a more functional solution without global state. In C#: …

From Cracking the Coding Interview. This solution is not complete, but it solves a useful subset of inputs and does it correctly. Getting a working solution for a subset of posisble inputs is better than an incomplete or flawed solution that tries to cover all possible cases, as long as…

2 easy string puzzles. From http://www.careercup.com/question?id=5642266903314432: Given a mapping configuration such as: 1:a 2:b ... 26:z And a string like "12632", print the number of different ways you can map such string to alphabet characters. For example, given "111" the answer is…