Given two integers n and k, return the largest n digit palindromic integer that is divisible by k, represented as a string.

A palindromic integer is an integer that reads the same backward as forward.

Note: An n digit integer cannot contain leading zeros.

Constraints:

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ k $\leq 9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.