sol2.py

"""
Project Euler Problem 4: https://projecteuler.net/problem=4

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 x 99.

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

References:
 - https://en.wikipedia.org/wiki/Palindromic_number
"""


defsolution(n: int=998001) ->int:
"""
 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
 """

answer=0
foriinrange(999, 99, -1): # 3 digit numbers range from 999 down to 100
forjinrange(999, 99, -1):
product_string=str(i*j)
ifproduct_string==product_string[::-1] andi*j<n:
answer=max(answer, i*j)
returnanswer


if__name__=="__main__":
print(f"{solution() =}")