Largest Palindrome Product LeetCode solution in Python

1
class Solution:
2
    def largestPalindrome(self, n: int) -> int:
3
        return [0, 9, 987, 123, 597, 677, 1218, 877, 475][n]
4

5
    def isPalindrome(x):
6
        return str(x) == str(x)[::-1]
7

8
    def solve(n):
9
        best = 0
10
        for i in range(10**n - 1, 0, -1):
11
            for j in range(max(i, (best - 1) // i + 1), 10**n):
12
                if isPalindrome(i * j):
13
                    # print(i, j, i*j)
14
                    best = i * j
15
        return best