Help with this question Please.

[kevon]

Well she has been here a long time before him, though not active ...

never even took note of that

[aksultra]

Solution for solving a palyndrome number is:
For Numbered Pals:
1.convert to String
2.then do a character replace from the said string into a blank string of the same length.
3.then convert the new string back to an int and check for a match with the original int.
4. If it matches then u know its a paly.


For Alpha/Alphanum Pals:
1.do a character replace from the said string into a blank string of the same length.
2.do a string compare with both strings(the original and the newly created string variable of the same size as the original string)
3. If it matches then u know its a paly.


So how do u do a character reverse replace.

1. First check the length of the String or character array, whicheva yuh use.
2. Then say start a loop which loops the amount of times equal to the length of the string. Then say the first character, or arrayname[c] is equal to reversedarrayname[lengthofarray-c]

One of the simplest ways to reverse a string, this method subtracts the current count from the length count of the string.

Hope this helps.