Closed andrew-field closed 5 years ago
A basic brute force method. This can probably be optimised. One could make reasonable assumptions to assume that the answer has 6 digits perhaps to cut down on the number of trials but this solution remains generic.
Updated to use the new library functions to find the digits of a number.
Updated to use strconv
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.