-
Notifications
You must be signed in to change notification settings - Fork 0
/
day-18.cpp
78 lines (67 loc) · 1.43 KB
/
day-18.cpp
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <iostream>
using namespace std;
class Solution
{
//Write your code here
char stack[100];
char queue[100];
int top = -1;
int front = -1, rear = -1;
public:
void pushCharacter(char ch)
{
stack[++top] = ch;
}
void enqueueCharacter(char ch)
{
queue[++rear] = ch;
if (front == -1)
{
front = rear;
}
}
char popCharacter()
{
return stack[top--];
}
char dequeueCharacter()
{
return queue[front++];
}
};
int main()
{
// read the string s.
string s;
getline(cin, s);
// create the Solution class object p.
Solution obj;
// push/enqueue all the characters of string s to stack.
for (int i = 0; i < s.length(); i++)
{
obj.pushCharacter(s[i]);
obj.enqueueCharacter(s[i]);
}
bool isPalindrome = true;
// pop the top character from stack.
// dequeue the first character from queue.
// compare both the characters.
for (int i = 0; i < s.length() / 2; i++)
{
if (obj.popCharacter() != obj.dequeueCharacter())
{
isPalindrome = false;
break;
}
}
// finally print whether string s is palindrome or not.
if (isPalindrome)
{
cout << "The word, " << s << ", is a palindrome.";
}
else
{
cout << "The word, " << s << ", is not a palindrome.";
}
return 0;
}