Kata

There were and still are many problem in CW about palindrome numbers and palindrome strings. We suposse that you know which kind of numbers they are. If not, you may search about them using your favourite search engine.

In this kata you will be given a positive integer, val and you have to create the function next_pal()(nextPal Javascript) that will output the smallest palindrome number higher than val.

Let's see:

For Python
next_pal(11) == 22

next_pal(188) == 191

next_pal(191) == 202

next_pal(2541) == 2552

For Javascript
nextPal(11) == 22

nextPal(188) == 191

nextPal(191) == 202

nextPal(2541) == 2552

For C#
Kata.NextPal(11) == 22

Kata.NextPal(188) == 191

Kata.NextPal(191) == 202

Kata.NextPal(2541) == 2552

For Ruby
next_pal(11) == 22

next_pal(188) == 191

next_pal(191) == 202

next_pal(2541) == 2552

For CoffeeScript
nextPal(11) == 22

nextPal(188) == 191

nextPal(191) == 202

nextPal(2541) == 2552

For Haskell
nextPal 11 == 22

nextPal 188 == 191

nextPal 191 == 202

nextPal 2541 == 2552

For C++
next_pal(11) == 22

next_pal(188) == 191

next_pal(191) == 202

next_pal(2541) == 2552

You will be receiving values higher than 10, all valid.

Enjoy it!!