Problem 172. Test if a Number is a Palindrome without using any String Operations

Solution 1836227

Submitted on 3 Jun 2019 by John Walker

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	x = 122131221; y_correct = true; assert( isequal(isNumPalindrome(x),y_correct) && isempty(regexp(evalc('type isNumPalindrome'),'(str\|printf\|eval\|flip\|dec2base)')) ) xfor = 0 xrev = 122131221
2	Pass	x = 1221; y_correct = true; assert( isequal(isNumPalindrome(x),y_correct) && isempty(regexp(evalc('type isNumPalindrome'),'(str\|printf\|eval\|flip\|dec2base)')) ) xfor = 0 xrev = 1221
3	Pass	x = 12345; y_correct = false; assert( isequal(isNumPalindrome(x),y_correct) && isempty(regexp(evalc('type isNumPalindrome'),'(str\|printf\|eval\|flip\|dec2base)')) ) xfor = 0 xrev = 54321
4	Pass	x = 9849; y_correct = false; assert( isequal(isNumPalindrome(x),y_correct) && isempty(regexp(evalc('type isNumPalindrome'),'(str\|printf\|eval\|flip\|dec2base)')) ) xfor = 0 xrev = 9489