1: #include <stdio.h>
2: #include <stdlib.h>
3: #include <string.h>
4: int check_palindrom(char *start, char *end)
5: {
6: if ( ((start+1) == end) || (start == (end-1)) || (start == end))
7: return 0;
8: if ( *start != *end)
9: return -1;
10: if ( *start == *end)
11: {
12: start++;
13: end--;
14: return check_palindrom(start,end);
15: }
16: }
17: main()
18: {
19: char *str = "forgeeksskeegfor";
20: char *start, *end, *temp1, *temp2;
21: int flag = 0,len = strlen(str);
22: len--;
23: start = str;
24: while(*start != '\0')
25: {
26: end = str + len;
27: while(start != end)
28: {
29: if ( *start == *end)
30: {
31: if ( 0 == check_palindrom(start,end))
32: {
33: printf("Yes it <%.*s> is palindrom \n",
34: end +1 - start,start);
35: flag = 1;
36: break;
37: }
38: }
39: end--;
40: }
41: start++;
42: if ( flag == 1)
43: break;
44: }
45: }
RTOS, Linux Kernel internal, OS-Programming C & Data Structures, Debugging, Optimizations, Makefiles and Wireless Technologies (Wi-Fi ,LTE and LTE-Advanced )
Search This Blog
Tuesday, October 20, 2015
Write a program to find the longest palindrome in any given string. Ex:forgeeksskeegfor Ans: geeksskeeg
Labels:
C
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment