I Solved the 4th problem from the Euler’s problem set using python and found that it can be done in multiple ways. The problem is related to palindrome concept.
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.
I first approached the problem statement by thinking that how many maximum digits will a number have so 2 three digits will have max 6 digits number when multiplied and that can be easily achieved by first multiplying the biggest numbers so I took a reverse loop. And then checked the condition of being a palindrome number and displayed the greatest one after comparison .
Python Code ->
palindrome = 0 # 2 variables to find the biggest palindrome for a in range(999, 100, -1): #First factor #second factor starts from a so that one multiplication does not repeat. for b in range(a, 100, -1): number = a * b if number > palindrome: #To check if number is a palindrome. x = str(a * b) if x == x[::-1]: palindrome = a * b print(palindrome)
Trying More Euler’s Problem and the same code with C++. 🙂