I've "solved" Project Euler Question 4 and I was wondering if I could make my answer more efficient (I'm using Project Euler to help me learn Haskell).
The problem reads:
Find the largest palindrome made from the product of two 3-digit numbers
Here is my solution
getMaxPalindrome = maximum[x*y | x<-[100..999], y<-[100..999], reverse(show(x*y)) ==show(x*y)]
All suggestions for improvement are appreciated!