## Project Euler in Haskell #4

2012-04-20 — Article of 700 words Programming Haskell Project Euler

## Problem Description

Link to Project Euler 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\times99$.

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

**WARNING**
*Solution ahead. Don’t read more if you want to enjoy the benefits of
Project Euler and you haven’t already solved the problem.*