@@ -0,0 +1,564 @@
+class Solution(object):%0A    def largestPalindrome(self, n):%0A        %22%22%22%0A        :type n: int%0A        :rtype: int%0A        %22%22%22%0A        if n == 1:%0A            return 9%0A        for x in xrange(3, 10 ** n):%0A            # two numbers 10 ** n - i, 10 ** n - j%0A            # x = i + j%0A            # reverse(10 ** n - x) = i * j%0A            y = int(str(10 ** n - x)%5B::-1%5D)%0A            D = x * x - 4 * y%0A            if D %3E= 0:%0A                sqrt_D = int((D + 0.5) ** .5)%0A                if sqrt_D ** 2 == D:%0A                    return ((10 ** n - x) * 10 ** n + y) %25 1337%0A

Add py solution for 479. Largest Palindrome Product