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

Created by @bmtran (Bryant Tran)

Solve Later

Description

Given an integer X, determine if it is a palindrome number. That is, X is equal to the X with the digits reversed (with no leading 0s). The twist is that your code cannot use any function or variable name that has either "str", "eval", "flip" or "printf" in it.

Example

    X = 123454321;
    Y = true;

    X = 1234;
    Y = false;

Solve

Solution Stats

Last solution submitted on Sep 06, 2019

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Freddy on 22 Mar 2012

Nice expression for the usage test. Maybe one can add function "dec2base", cause the return type is a String.

Christian Schröder on 15 Jul 2019

The problem description should mention that dec2base isn't allowed either.

Solution Comments

Solution 320090

1 Comment

1 Comment

Paul Berglund on 17 Sep 2013

This will fail to detect certain palindromes which contain zero e.g. 10101 however the test suite doesn't (yet) contain any such.

Solution 51938

1 Comment

1 Comment

Nikolai on 26 Feb 2012

There's something strange with the Cody test suites today...

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

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers151

Suggested Problems

More from this Author57

Tags

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

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Recent Solvers151

Suggested Problems

More from this Author57

Tags

Players