Project Euler #4: Largest palindrome product

  • + 0 comments

    ****def l_pal(n): s=[] for i in range(101,1000): for j in range(121,1000,(1 if i%11==0 else 11)): product = i*j if int(str(product)[::-1]) == product: if product

    if name == 'main': t = int(input().strip())

    for t_itr in range(t):
        n = int(input().strip())
        print(l_pal(n))