-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCode2.py
52 lines (40 loc) · 1.03 KB
/
Code2.py
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
# Hints: function definition, Modulo
def palindrome(a):
mid = (len(a)-1)//2
start = 0
last = len(a)-1
flag = 0
while(start<mid):
if (a[start]== a[last]):
start += 1
last -= 1
else:
flag = 1
break;
if flag == 0:
print("The entered string is palindrome")
else:
print("The entered string is not palindrome")
def symmetry(a):
n = len(a)
flag = 0
if n%2:
mid = n//2 +1
else:
mid = n//2
start1 = 0
start2 = mid
while(start1 < mid and start2 < n):
if (a[start1]== a[start2]):
start1 = start1 + 1
start2 = start2 + 1
else:
flag = 1
break
if flag == 0:
print("The entered string is symmetrical")
else:
print("The entered string is not symmetrical")
string = 'amaama'
palindrome(string)
symmetry(string)