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 (x100001) + (y10010) + (z*1100) in JavaScript. Hmm.

Edit: It probaby was a weird issue that I had. parseInt trick doesn’t work anymore.