Package g0401_0500.s0479_largest_palindrome_product

Class Solution

java.lang.Object
g0401_0500.s0479_largest_palindrome_product.Solution
public class Solution extends java.lang.Object
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

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    largestPalindrome(int n)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • largestPalindrome

      public int largestPalindrome(int n)