Project Euler Problem 4

Problem4.rb

MAX_NUM   = 999
MIN_NUM   = 100

def is_palindrome?(num)

  if num.to_s() == num.to_s().reverse
    true
  else
    false
  end
end

def find_largest_palindrome()
  max_found = 0
  
  MAX_NUM.downto(MIN_NUM) { |i|
  
    MAX_NUM.downto(MIN_NUM) { |j|
      
      if is_palindrome?(i*j)
        if i*j > max_found
          max_found = (i*j)
        end
      end
      
    }
    
  }
  
  max_found
end

print find_largest_palindrome.to_s