DSA Python Simple
DSA Python Simple
if num % 2 == 0:
print("Even")
else:
print("Odd")
def factorial(n):
if n == 0:
return 1
return n * factorial(n-1)
print(factorial(5))
if s == s[::-1]:
print("Palindrome")
else:
print("Not a Palindrome")
print(max(numbers))
a, b = 0, 1
for _ in range(n):
a, b = b, a + b