int main(int argc, char* argv[])
{
char a[10],b[10];
printf("enter any string\n");
scanf("%s",a);
printf("a=%s",a);
strcpy(b,a);
strrev(b);
printf("\nb=%s",b);
if(strcmp(a,b)==0)
printf("\nstring is palindrome");
else
printf("\nnot pelindrome");
return 0;
}
You don't have to write palindrome programs in wikipedia.
forward(word) backward(word)
def isPalindrome(s): return s == s[::-1] then just call the function with a string like isPalindrome('poop')
sdfdg
Palindrome number is a number like 121 which remains the same when its digits are reversed. To find this number in a simple java program, just follow the below way. sum = 0; while(n>0) { r=n % 10; sum=concat(r); n=n / 10; } print r;
You can do this: <?php if ( $word === strrev( $word ) ) { echo "The word is a palindrome"; } else { echo "The word is not a palindrome"; }
You don't have to write palindrome programs in wikipedia.
int pallindrom(int p){ /*write all logic*/ }
It is a simple program. i think u may understand it :#include#include#includevoid main(){char s[10]=answers.com;char x[10];int a;clrscr();strcpy(x,s);strrev(s);a=strcmp(s,x);if(a==0){printf("the entered string is palindrome");}else{printf("the entered string is not palindrome");}output:given string is not palindrome
forward(word) backward(word)
Into the source program.
def isPalindrome(s): return s == s[::-1] then just call the function with a string like isPalindrome('poop')
sdfdg
Palindrome number is a number like 121 which remains the same when its digits are reversed. To find this number in a simple java program, just follow the below way. sum = 0; while(n>0) { r=n % 10; sum=concat(r); n=n / 10; } print r;
Write your program and if you are having a problem post it here with a description of the problem you are having. What you are asking is for someone to do your homework for you.
write a program that reads a phrase and prints the number of lowercase latters in it using a function for counting? in C program
write a c++program by using if statement to read a number and check whether it is positive or negative