Adding a new version of the solution of PALIN classical problem. Now
the algorithm doesn’t consider increment number by number and decides
if the current number is palindrome. Instead it is work O(K) where K is
the amount of digits of the input number.