Data-Structures/STACKS/C/Check_Palindrome.c at master · Anonymous866/Data-Structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <stdio.h>
#include <string.h>

char arr[10000];
char stack[10000];
int len = 0;

void push(char ch){
	stack[len] = ch;
	len++;
}

void pop(){
	if(len)
		len--;
	else
		return;
}

char peek(){
	if(len)
		return stack[len-1];
	else
		return '\0';
}

int main(){
	printf("enter the string: ");
	scanf("%s",arr);
	for(int i=0;i<strlen(arr)/2;i++){
		push(arr[i]);
	}
	int flag = 0;
	if(strlen(arr) % 2){
		for(int i=strlen(arr)/2 + 1;i<strlen(arr);i++){
			if(peek() != arr[i]){
				printf("string is not palindrome\n");
				flag = 1;
				break;
			}
			else
				pop();
		}
	}
	else{
		for(int i=strlen(arr)/2;i<strlen(arr);i++){
			if(peek() != arr[i]){
				printf("string is not palindrome\n");
				flag = 1;
				break;
			}
			else{
				pop();
			}
		}
	}
	if(!flag)
		printf("string is a palindrome\n");
}