Write a program that asks the user to prompt an Integer number and then test whether it is Palindrome Numbers or not.
The following are Palindrome numbers:
1. 22
2. 333
3. 67876
4. 44444
5. 123454321
abhishekm 71 I know I don't want to give it to me but the problem that I don't understand it clearly and especially Palindrome
and keskiverto thank you I know that's why I signed up here...
The loop looks two characters at a time, one from both ends of the word. If the are not the same, then the word is not a palindrome.
There is a way to hide the loop by using existing library code. First, make a copy of the word (std::string copy constructor). Then reverse that copy (std::reverse). Last, test the equality of the reversed copy and the original (std::string::operator==).
Start simple. Make a for-loop that prints out every character of the word, one at a time, and the index of that character.