Project Euler : Problem 004

[Franck]

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.

Code: Select all

// Here, brute force is used
// pe004 ( -- n ) : Returns largest palindrome
: pe004
| i j |
   0 999 100 -1 step: i [
      i 100 -1 step: j [
         i j * dup asString dup reverse == ifTrue: [ max ] else: [ drop ]
         ]
      ] ;