Problem 004


Project Euler

Largest palindrome product

Problem 4

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

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


The largest palindrome can be found by check the largest 3-digit numbers first. In this case, once a palindrome is found, any number smaller than that will not needed to be check. The complexity is O(n^2) where n is the largest 3-digit numbers that is being checked.

Advertisements