3260. Find the Largest Palindrome Divisible by K

LeetCodeMathStringDynamic ProgrammingGreedyNumber TheoryOpen on judge ↗

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:

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI