Largest Palindrome Product - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
479. Largest Palindrome Product
Hard
50 Points
Math
Enumeration
Given an integer n, return the largest palindromic integer that can be represented as the product of two n-digits integers. Since the answer can be very large, return it modulo 1337.
Examples
Example 1
Input: n = 2
Output: 987
Explanation: 99 x 91 = 9009, 9009 % 1337 = 987
Example 2
Input: n = 1
Output: 9
Constraints
1 <= n <= 8
479. Largest Palindrome Product
Hard
50 Points
Math
Enumeration
Given an integer n, return the largest palindromic integer that can be represented as the product of two n-digits integers. Since the answer can be very large, return it modulo 1337.
Examples
Example 1
Input: n = 2
Output: 987
Explanation: 99 x 91 = 9009, 9009 % 1337 = 987