Problem Solving Series(For Interview) (9 Part Series)

1) Multiples of 3 and 5 - Project Euler Solution
2) Two sum - Leet Code Solution
3 ... 7
3) Check for Armstrong Number
4) Largest palindrome product - Project Euler Solution
5) Smallest multiple - Project Euler Solution
6) Sum square difference - Project Euler Solution
7) 10001st prime - Project Euler Soution
8) Sieve of Eratosthenes
9) Bubble Sort Implementation in Python

### 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

Problem Solving Series(For Interview) (9 Part Series)

1) Multiples of 3 and 5 - Project Euler Solution
2) Two sum - Leet Code Solution
3 ... 7
3) Check for Armstrong Number
4) Largest palindrome product - Project Euler Solution
5) Smallest multiple - Project Euler Solution
6) Sum square difference - Project Euler Solution
7) 10001st prime - Project Euler Soution
8) Sieve of Eratosthenes
9) Bubble Sort Implementation in Python

Posted on by:

### CodePerfectPlus

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

## Discussion