loading...
Cover image for Largest palindrome product - Project Euler Solution

Largest palindrome product - Project Euler Solution

codeperfectplus profile image CodePerfectPlus Updated on ・1 min read

Largest palindrome product - Project Euler Solution

Topic: Largest palindrome product

Problem Statement:

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

Find the largest palindrome made from the product of two 3-digit numbers.

You can find the original question here -> Project Euler

Largest palindrome product - Project Euler Solution

def largestPalindrome(bot, top):
    z = 0
    for i in range(top, bot, -1):
        for j in range(top, bot, -1):
            if isPalindrome(i*j):                
                if i * j > z:
                    z = i * j
    return z

def isPalindrome(num):
    return str(num) == str(num)[::-1]

print(largestPalindrome(100,999))

Share Your Solutions for the Largest palindrome product

Posted on by:

codeperfectplus profile

CodePerfectPlus

@codeperfectplus

Skilled in Data Science, Machine Learning, Deep Learning, As Well As Web Development Knowledge. React ❤️ to encourage Author.

Discussion

markdown guide