LeetCode Algorithm for https://leetcode.com/problems/largest-palindrome-product/

Largest Palindrome Product.py

import time


for digitSize in range(1, 9):
    print('Calculating ' + str(digitSize) + '...')
    digits = digitSize
    maxNum = (10 ** digits) - 1

    maxProd = str(maxNum * maxNum)

    firstHalf = maxProd[0:len(maxProd) // 2]
    found = False

    start = time.time()
    for x in range(int(firstHalf), 0 ,-1):  # range(start, stop, step)
        if not found:
            palindrome = str(x) + str(x)[::-1]
            palindrome = int(palindrome)

            if int(palindrome) <= int(maxProd) and not found:
                for a in range(1, int((int(palindrome) ** .5) + 1) + 1, 1):  # finding factors

                    if int(palindrome) % a == 0 and int(a) <= maxNum and int(palindrome / a) <= maxNum:
                        pair = [int(a), int(palindrome / a)]
                        print('palindrome: ' + str(palindrome))
                        print('factors under max product: ' + str(pair))
                        found = True
                        break

    end = time.time()

    print('calculated in ' + str(end - start) + ' s