Largest Palindrome Product

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99 Find the largest palindrome made from the product of two 3-digit numbers.

 palindromes = []

for i = 0:999
    for j = 0:999
        prod = i * j
        if digits(prod) == reverse(digits(prod)) 
            push!(palindromes, prod)
        end
    end
end

print(findmax(palindromes))

906609