July 22nd, 2011
0 comments

June 15th, 2011
0 comments

This week I am shifting to programs which require some programming to solve.

Given a string, return the largest palindrome substring. A palindrome is a string which is identical when reversed (E.G. a, aa, aba, abcba).

When you have your solution, run it on the following string:

I originally found this problem at programmingpraxis.com

June 6th, 2011
1 comment

Given a rectangular cake with a rectangular piece removed (any size or orientation), how would you cut the remainder of the cake into two equal halves with one straight cut of a knife?

June 2nd, 2011
0 comments

Given a **32 bit** 2's complement number and the bitwise operation set **&** (and), **|** (or), **^** (xor), **<<** and **>** (left and right shifting) define an equation or algorithm to count the number of bits which are set to 1 in the string without looping structures. Registers (variables) are allowed.

In other words: write the following C function without loops:

int set_bits_count(int input) {

}

May 29th, 2011
0 comments
### The Conundrum:

On my current Rails application, I was faced with solving a specific problem: how do I use Paperclip to store many files generated by a single processor without being able to predict how many files there will be or what their names will be. ... (continued)