Problem 3260 · Hard

Find the Largest Palindrome Divisible by K

Find the largest n-digit palindrome with no leading zero that is divisible by k, using remainder reachability to fix digits from the outside in.

Open the interactive visualisation