Tap here to switch tabs
Problem
Submissions

Problem: Largest Palindrome Product

Largest Palindrome Product asks you to find the greatest palindromic number formed by multiplying two integers with the same fixed number of digits, then return it modulo a specified value.

Statement

Given an integer n, find the largest palindromic number that can be formed by the product of two n digit integers.

Since the result may be very large, return the answer modulo 13371337.

Constraints:

  • 1≤1 \leq n ≤8\leq 8

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Largest Palindrome Product

Largest Palindrome Product asks you to find the greatest palindromic number formed by multiplying two integers with the same fixed number of digits, then return it modulo a specified value.

Statement

Given an integer n, find the largest palindromic number that can be formed by the product of two n digit integers.

Since the result may be very large, return the answer modulo 13371337.

Constraints:

  • 1≤1 \leq n ≤8\leq 8