Palindromic Integer Checker

Question

One of our assignments in working with C++ in 1st year programming was to write a function that can check if a number is palindromic or not (e.g 16461). I'd upload my code but I don't even know where to begin when it comes to extracting digits from an integer or checking the number of digits in an integer. Any help or hints would be appreciated!

Answer 1

There are many ways to solve this. I like most the solution that builds the mirror number and checks whether it is identical to the original (even though, it is arguably not the most efficient way). The code should be something like:

bool isPalindrom(int n) {
  int original = n;
  int mirror = 0;
  while (n) {
    mirror = mirror * 10 + n % 10;
    n /= 10;
  }
  return mirror == original;
}