• Home
• com.github.javadev
• leetcode-in-java
• 1.27
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0401_0500.s0479_largest_palindrome_product.readme.md Maven / Gradle / Ivy

479\. Largest Palindrome Product

Hard

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`.

**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`