We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
****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))
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #4: Largest palindrome product
You are viewing a single comment's thread. Return to all 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())