Package g3201_3300.s3260_find_the_largest_palindrome_divisible_by_k

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3260 - Find the Largest Palindrome Divisible by K.

    Hard

    You are given two positive integers n and k.

    An integer x is called k-palindromic if:

    • x is a palindrome.

    • x is divisible by k.

    Return the largest integer having n digits (as a string) that is k-palindromic.

    Note that the integer must not have leading zeros.

    Example 1:

    Input: n = 3, k = 5

    Output: "595"

    Explanation:

    595 is the largest k-palindromic integer with 3 digits.

    Example 2:

    Input: n = 1, k = 4

    Output: "8"

    Explanation:

    4 and 8 are the only k-palindromic integers with 1 digit.

    Example 3:

    Input: n = 5, k = 6

    Output: "89898"

    Constraints:

    • <code>1 <= n <= 10<sup>5</sup></code>

    • 1 &lt;= k &lt;= 9

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String largestPalindrome(Integer n, Integer k)

      • Methods inherited from class java.lang.Object

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