We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent c6a0f44 commit 162fa20Copy full SHA for 162fa20
src/main/java/com/fishercoder/solutions/_479.java
@@ -1,20 +1,5 @@
1
package com.fishercoder.solutions;
2
3
-/**
4
- * 479. Largest Palindrome Product
5
- *
6
- * Find the largest palindrome made from the product of two n-digit numbers.
7
- Since the result could be very large, you should return the largest palindrome mod 1337.
8
-
9
- Example:
10
- Input: 2
11
- Output: 987
12
13
- Explanation: 99 x 91 = 9009, 9009 % 1337 = 987
14
15
- Note:
16
- The range of n is [1,8].
17
- */
18
public class _479 {
19
public static class Solution1 {
20
/**
0 commit comments