Leetcode 2081. Sum of k-Mirror Numbers
Find the sum of the n smallest positive integers that are palindromic both in base-10 and in base-k. Efficient solutions generate decimal palindromes in increasing order (by length/value) and test their base-k representation for palindrome until n numbers are found (n ≤ 30, 2 ≤ k ≤ 9).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.