Today’s problem had to do with Happy Numbers.
I split the problem up in two parts, splitting up a number up in to digits and checking whether or not the number is a Happy Number.
Today’s problem had to do with Happy Numbers.
I split the problem up in two parts, splitting up a number up in to digits and checking whether or not the number is a Happy Number.
This is my first solution for a Programming Praxis assignment, the Word Cube problem.
It’s definitely not an elegant solution. It’s almost as brute force as it can get, but I have only a negligible amount of training in this field so I’m satisfied for now with being able to find a solution at all.
It takes a few minutes to find all the possible words. I did however find quite a few more than the ones mentioned in the assignment.
Click here to see the source code.