Largest Product Pallindrome
Easy Accuracy: 51.2% Submissions: 149 Points: 2

Given a value N, find out the largest palindrome number which is product of two N-digit numbers.
 

Example 1:

Input: N = 2
Output: 9009
Explanation: 9009 is the largest number 
which is product of two 2-digit numbers. 
9009 = 91*99.

Example 2:

Input: N = 1
Output: 9
Explanation: 9 is the largest number 
which is product of two 1-digit numbers. 
3 * 3 = 9.

 

Your Task:
You don't need to read or print anyhting. Your task is to complete the function LargestProductPalin() which takes N as input parameter and returns largest palindromic product of 2 N-digit numbers.

 

Expected Time Complexity: O(10n+1)
Expected Space Complexity: O(1)

 

Constraints:
1 <= N <= 6

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Largest Product Pallindrome

Output Window