recursion.py

#recursive function
def show(n):
    if(n== 0): #Base case
        return
    
    print(n)
    show(n-1)
    
# show(5)

def fact(n):
    if( n ==0 or n==1):
        return 1
    else:
        return n* fact(n-1)
    
# print(fact(5))

#practice Question

def cal_sum(n):
    if(n==0):
        return 0
    return cal_sum(n-1)+n #khud ko hi call karta he bas kuch updation de baad 
sum= cal_sum(10)
# print(sum)

def print_list(list,indx=0):
    if(indx == len(list)):
        return
    print(list[indx])
    print_list(list, indx+1)
    
fruits =[ "Apple","Mango","Banana","Lichi"]
# print_list(fruits)

def two_sum(nums, target):
    
    for i in range(len(nums)):
        for j in range(i + 1, len(nums)):
            if nums[i] + nums[j] == target:
                return [i, j]

nums=[2,7,11,17]
target = 9
# print(two_sum(nums,target))

def is_palindrome(num):
    return str(num) == str(num)[::-1]

number = 121
if is_palindrome(number):
    print(f"{number} is a palindrome.")
else:
    print(f"{number} is not a palindrome.")
    

class Solution(object):
    # @staticmethod
    def is_palindrome(num):
        return str(num) == str(num)[::-1]

number = 121
if Solution.is_palindrome(number):
    print(f"{number} is a palindrome.")
else:
    print(f"{number} is not a palindrome.")