Project euler problem 4 solution

Issue4.scala

object Issue4 {
  val MIN = 100
  val MAX = 999

  def isPalindromic(n: Int) = {
    val s = n.toString
    s == s.reverse
  }

  def maxPalindromic() = {
    val palindromics = for (i:Int <- MAX.to(MIN, -1); j:Int <- MAX.to(MIN, -1); n = i * j; if (isPalindromic(n)))
      yield n
    palindromics.max
  }

  def main(args: Array[String]) {
    assert(906609 == maxPalindromic())
  }
}