Find the Count of Good Integers
You are given two positive integers n and k.
An integer x is called k-palindromic if:
xis a palindrome.xis divisible byk.
An integer is called good if its digits can be rearranged to form a k-palindromic integer. For example, for k = 2, 2020 can be rearranged to form the k-palindromic integer 2002, whereas 1010 cannot be rearranged to form a k-palindromic integer.
Return the count of good integers containing n digits.
Note that any integer must not have leading zeros, neither before nor after rearrangement. For example, 1010 cannot be rearranged to form 101.
Example 1
Input
n = 3, k = 5Output
27Some good integers include 551, which can be rearranged to form 515, and 525, which is already k-palindromic.
Example 2
Input
n = 1, k = 4Output
2The two good integers are 4 and 8.
Constraints
- 1 <= n <= 10
- 1 <= k <= 9
Asked at 2 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.