@@ -0,0 +1,418 @@
+def is_palindrome(str):%0A    return str == str%5B::-1%5D%0A%0A%0Adef find_largest_palindrome_product():%0A    max = 0%0A    for x in range(999, 99, -1):%0A        for y in range(x, 99, -1):%0A            product = x * y%0A            if product %3C= max:%0A                break%0A            elif is_palindrome(str(product)):%0A                max = product%0A    return max%0A%0Aif __name__ == %22__main__%22:%0A    print(find_largest_palindrome_product())%0A

add problem0004.py