Answering The Fourth Problem On Project Euler
Yet another Project Euler problem, solved with rather brute force. I simply became too business process oriented to develop clever solutions to mathematical problems, maybe? =)
The Problem
Finding the largest palindrome made from the product of two 3-digit numbers.
The Solution
Sorry for the lack of elegance. The most interesting thing to learn while coding this was finding out that parseInt([x,y,z,z,y,x].join("")) was much faster than (x*100001) + (y*10010) + (z*1100) in JavaScript. Hmm.
blog comments powered by Disqus