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? =)
Finding the largest palindrome made from the product of two 3-digit numbers.
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
Edit: It probaby was a weird issue that I had.
parseInt trick doesn’t work anymore.