Euler4.exs

# 3digit * 3digit, which is palindrome

defmodule Problem4 do

  def palindrome?(n) do
    s = to_string(n)
    String.reverse(s) == s
  end
  
  def solve do
    for i <- (100..999), 
        j <- (100..999), 
        n = i * j,
        palindrome?(n),
        do: n
  end
  
  def print do
    IO.inspect Enum.max(solve())
  end

end

Problem4.print