Euler problem 4.2

.

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

g = [(y, z, y*z) | y<-[100..999], z<-[y..999], f==y*z]
    where
      f = maximum [x | y<-[100..999], z<-[y..999],
                   let x=y*z, let s=show x, s==reverse s]

— based on Haskell offical

.

— Me@2022-10-10 10:09:53 PM

.

.

2022.10.10 Monday (c) All rights reserved by ACHK