Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Consecutive Numbers Sum
Coding · Enumeration · Math
- Find the Minimum Number of Fibonacci Numbers Whose Sum Is K
Coding
- Sum of Even Numbers After Queries
Coding
- Sum of Good Numbers
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2081. Sum of k-Mirror Numbers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source