Category Archives: Racket

Palindrome in Racket

Posted on by

Solution to Project Euler problem 4

#lang racket
(define (isPalindrome x)
  (equal? x (reverseStr x)))
(define (ToStr x)
  (number->string x))
(define (reverseStr x)
  (list->string(reverse(string->list x))))
(define maxPal 0)
(for* ([i (in-range 100 1000)]
       [j (in-range 100 1000)])
  (let ([prod (* i j)])
    (cond [(and (isPalindrome(ToStr prod)) (> prod maxPal))
           (set! maxPal prod)])))
(printf "~a~n" maxPal)