project euler problem 4 https projecteuler netproblem4 largest palindrome product a palindromic number reads the same both ways the largest palindrome made from the product of two 2digit numbers is 9009 91 99 find the largest palindrome made from the product of two 3digit numbers references https en wikipedia orgwikipalindromicnumber returns the largest palindrome made from the product of two 3digit numbers which is less than n solution20000 19591 solution30000 29992 solution40000 39893 returns the largest palindrome made from the product of two 3 digit numbers which is less than n solution 20000 19591 solution 30000 29992 solution 40000 39893 3 digit numbers range from 999 down to 100
def solution(n: int = 998001) -> int:
    

    answer = 0
    for i in range(999, 99, -1):  
        for j in range(999, 99, -1):
            product_string = str(i * j)
            if product_string == product_string[::-1] and i * j < n:
                answer = max(answer, i * j)
    return answer


if __name__ == "__main__":
    print(f"{solution() = }")