d7-recursion

1) palindrome 
n = 'nitinui'

last = (len(n))-1

for i in range(0,last):

    if n[i] == n[last-i]:

     a= 'yes'

     b= 'yes'

    else:

     b='no'

if a == 'no' or b =='no':

    print('no')

else:

    print('yes')

 
 
 
 
 2)count no. of 0
 def zero(n):
    if n == 0:
        return 0
    elif n%10 == 0:
        return 1 + zero(int(n/10))
    else:
        return zero(int(n/10))
        
print(zero(4005080))