Problem 4 of Project Euler in Clojure

euler4.clj

(defn palindrome?
  "Is x the same read backwards?"
  [x]
  (let [s (seq (str x))]
    (= s (reverse s))))
 
(def three-digit-products
  "All the products of two three-digit numbers"
  (for [x (range 100 999)
        y (range 100 999)]
    (* x y)))
 
;; Find the maximum number composed of two three-digit
;; products that is a palindrome.
(reduce max (filter palindrome? three-digit-products)