Hi,<BR><BR>I'm currently coding a function in Java that will find the number of possible combinations for a string. I've run into a problem in to a problem with regards to both speed and memory usage.

Having stumbled upon Project Euler sometime ago and solving the first problem, this disco dancer from the Age of Aquarius thought it was time to tackle problem two, which states: Each new term in the ...