print("hello")
a = int(input("Enter the number "))
print(a)
stri = input("Enter the string")
stri
if stri == stri[::-1]:
print("palindrome")
else:
print("not palindrome")
l = [1, 65, 6, 26]
l2 = l.copy()
l.reverse()
if l == l2:
print("pal")
else:
print("not ")
la = [1,1,2,3,5,1,2,3]
se = set(la)
se
la = [1, 2, 3, 4, 5, 6, 7, 8, 9]
le = [l for l in la if l % 2 == 0]
lo = [l for l in la if l % 2 != 0]
le
lo
def means(l3):
return sum(l3) / len(l3)
print(means([1, 2, 3, 4, 5]))
def fibo(n):
a, b = 0, 1
print("0", "1")
for i in range(n):
a, b = b, a + b
print(b)
fibo(12)
la = [15, 19, 30, 23, 26, 31, 25, 35]
la.sort()
l4 = []
for i in range(0, 36, 11):
l4.append([k for k in la if k < i and (k >= i - 11)])
l4.append([k for k in la if k >= 33 and k is not None])
del l4[0]
l5 = [len (i) for i in l4]
print("array " , l4)
print("count", l5)
import numpy as np
a = np.array([45,545,656,56,6,62,62,62,6])
print(a)
min_a = a.min()
max_a = a.max()
nor_a = [(i-min_a)/(max_a-min_a) for i in a]