-- 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.

isPalindrome :: Int -> Bool
isPalindrome n = show n == reverse (show n)

maxPalindrome :: Int
maxPalindrome =
    maximum . filter isPalindrome $ (*) <$> [100..999] <*> [100..999]

main = do
    let result = maxPalindrome
    putStrLn $ "Project Euler, Problem 4\n"
        ++ "Answer: " ++ show result