Project Euler, Problem 4: Largest Palindrome Product

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is $9009 = 91 \times 99$ .

Find the largest palindrome made from the product of two 3-digit numbers.

Runtime: 0

Average: 0 Runs: 0

SD: 0 ms

Max: 0

Min: 1000

To solve this, I only multiplied the largest 3-digit numbers: 900-999.

Using nested for loops, I iterated through the 10,000 candidate number combinations finding palindrome numbers (via a helper function) and output the largest number.

###,###