# Find the largest palindrome made from the product of two 3-digit numbers.

import numpy as np

def is_palindrome(n):
    return str(n) == str(n)[::-1]

a = np.arange(999, 99, -1)
b = np.arange(999, 99, -1)

palindromes = []

for i in a:
    for j in b:
        p = i * j
        if is_palindrome(p):
            palindromes.append(p)

max(palindromes)
