You are viewing a single comment's thread. Return to all comments →
Python3 Solution
pl = [] for i in range(100, 1000): for j in range(100, 1000): pro = i * j if str(pro)[::-1] == str(pro): pl.append(pro) pl.sort(reverse=True) for i in range(int(input())): n = int(input()) for j in pl: if j < n: print(j) break
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 →
Python3 Solution