Beta
Smallest palindrome divisible by the input
6 of 48ThorstenLudwig
Description:
A palindromic number is a number that is the same read from left to right and read from right to left. A few examples are 1, 22, 343 or 38766783.
In this kata you have to calculate the smallest multiple of an input n that is a palindromic number. n is a positive integer that is not divisible by 10. Examples:
(smallest-palindrome 1) => 1
(smallest-palindrome 16) => 272
(smallest-palindrome 17) => 272
(smallest-palindrome 111) => 111
Algorithms
Fundamentals
Similar Kata:
Stats:
| Created | Aug 26, 2016 |
| Published | Aug 26, 2016 |
| Warriors Trained | 155 |
| Total Skips | 28 |
| Total Code Submissions | 143 |
| Total Times Completed | 48 |
| Clojure Completions | 6 |
| Java Completions | 44 |
| Total Stars | 1 |
| % of votes with a positive feedback rating | 89% of 31 |
| Total "Very Satisfied" Votes | 26 |
| Total "Somewhat Satisfied" Votes | 3 |
| Total "Not Satisfied" Votes | 2 |
| Total Rank Assessments | 30 |
| Average Assessed Rank | 7 kyu |
| Highest Assessed Rank | 6 kyu |
| Lowest Assessed Rank | 8 kyu |
