DEV Community

Cover image for Largest palindrome product - Project Euler Solution
Deepak Raj
Deepak Raj

Posted on • Edited on • Originally published at codeperfectplus.com

5 3

Largest palindrome product - Project Euler Solution

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))
Enter fullscreen mode Exit fullscreen mode

Share Your Solutions for the Largest palindrome product

Image of Datadog

Create and maintain end-to-end frontend tests

Learn best practices on creating frontend tests, testing on-premise apps, integrating tests into your CI/CD pipeline, and using Datadog’s testing tunnel.

Download The Guide

Top comments (0)

Postmark Image

Speedy emails, satisfied customers

Are delayed transactional emails costing you user satisfaction? Postmark delivers your emails almost instantly, keeping your customers happy and connected.

Sign up