Day-5

#PALINDROME

def is_palindrome(s):
    ss = str(s)
    if ss == ss[::-1]: return True
    return False

print(is_palindrome("n1a2m2a1n"))


r = "Rishab"
rr = ""
for i in range(len(r)-1,-1,-1):
    rr += r[i]

print(rr)
print(r[::-1])


print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")

#ARMSTRONG NUMBER
'''
153
1^3 + 5^3 + 3^3 == 153

1634
1^4 + 6^4 + 3^4 + 4^4 == 1634
'''

def is_armstrong(n):
    sn = str(n)
    ln = len(sn)

    t = 0
    for i in sn:
        t += int(i)**ln

    if t == n:
        return True
    return False


print(is_armstrong(407))



print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")

l1 = [10,2,3,4,6,7,1,9,8,44]
l2 = [9,4,4,7,1,9,0,3]

#counter = min(len(l1), len(l2))

ll1 = len(l1)
ll2 = len(l2)

if ll1>ll2: counter = ll2
else: counter = ll1

l3 = []
for i in range(counter):
    l3.append(l2[i]-l1[i])

print(l3)


print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")


l1 = [10,2,3,4,6,7,1,9,8,44]
l2 = [9,4,4,7,1,9,0,3]

#DESIRED ANS: [-1, 2, 1, 3, -5, 2, -1, -6, -8, -44]

ll1 = len(l1)
ll2 = len(l2)

if ll1>ll2: counter = ll1
else: counter = ll2


l3 = []
for i in range(counter):
    if i>=len(l2):
        l3.append(-1*l1[i])
    else:
        l3.append(l2[i]-l1[i])

print(l3)


print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")

mat1 = [ [1 , 2, 3],
         [4 , 5, 6],
         [7 , 8, 9],
         [10,11,12] ]

mat2 = [ [10,20,30],
         [40,50,60],
         [70,80,90],
         [10,20,30] ]

mat3 = [ [],
         [],
         [],
         [] ]

for i in range(len(mat1)):
    for j in range(len(mat1[0])):
        mat3[j].append(mat1[i][j] + mat2[i][j])

for i in range(len(mat3)):
    print(mat3[i])


'''
[1,2,3]      [1,4,7]
[4,5,6]  ->  [2,5,8]
[7,8,9]      [3,6,9]
'''
print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")

mat1 = [ [1 , 2, 3],
         [4 , 5, 6],
         [7 , 8, 9] ]

rows = len(mat1)
cols = len(mat1[0])

mat2 = [ [],
         [],
         [] ]

for i in range(rows):
    for j in range(cols):
        mat2[j].append(mat1[i][j])

for i in range(len(mat1)):
    print(mat1[i])

print("--------------")

for i in range(len(mat2)):
    print(mat2[i])

print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")


mat1 = [ [1,2],
         [3,4] ]

mat2 = [ [5,6],
         [7,8] ]

mat3 = [ [0,0],
         [0,0] ]


for i in range(len(mat1)):
    for j in range(len(mat2[0])):
        for k in range(len(mat2)):
            mat3[i][j] += mat1[i][k] * mat2[k][j]

for i in range(len(mat3)):
    print(mat3[I])


print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")


#SMALLEST FROM THE LIST

l = [4,5,6,2,3,9,1]

minl = l[0]

for i in range(len(l)):
    if l[i] < minl:
        minl = l[i]

print(minl)


#LARGEST FROM THE LIST

l = [4,5,6,2,3,9,1]

maxl = l[0]

for i in range(len(l)):
    if l[i] > maxl:
        maxl = l[i]

print(maxl)


# 2nd LARGEST FROM THE LIST

l = [4,6,2,3,9,1]
#l.sort()
#print(l[-2])

mn = max(l[0],l[1])   #SBSE BADA NUMBER
sn = min(l[0],l[1])   #USSE CHHOTA NUMBER

for i in range(2,len(l)):
    if l[i] > mn:
        sn = mn
        mn = l[i]

    elif l[i] > sn and mx > l[i]:
        sn = l[i]

print("MEHNAT:", sn)


print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")

#SEARCHING

l = [1,3,12,4,5,12,7,12,9,44,12,12,87,54,12,30,76]

e = 12

for i in range(len(l)):
    if l[i] == e:
        print("Found! at", i+1, "th position")
        break

print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")

#BINARY SEARCH

l = [1,2,3,4,5,6,7,8,9,10]

def binsearch(arr, x):
    low = 0
    high = len(arr) - 1
    mid = 0

    while low <= high:
        mid = (low+high)//2

        if arr[mid] < x:
            low = mid + 1

        elif arr[mid] > x:
            high = mid - 1

        else:
            return mid

    return -1

print(binsearch(l,3))



print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")


#INSERTION SORT


def insertion_sort(arr):
    for i in range(1, len(arr)):
        key = arr[i]

        j = i-1
        while j>=0 and key < arr[j]:
            arr[j+1] = arr[j]
            j-=1

        arr[j+1] = key

        print(i,"th iteration: ", arr)
    print(arr)

insertion_sort([5,3,8,1,7])



print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")


#RECUSRION!
#5! = 5*4*3*2*1

def fact(n):
    f = 1
    for i in range(2,n+1):
        f *= i

    return(f)

print(fact(5))



def fact_rec(n):
    if n<2:
        return 1
    else:
        return n*fact_rec(n-1)

print(fact_rec(5))



print("")
print("")
print("---------------------------------------------------------------")
print("")
print("")

def fib(n):
    n1 = 0
    n2 = 1
    print(n1)
    print(n2)
    for i in range(n):
        nth = n1 + n2
        n1 = n2
        n2 = nth
        print(nth)


fib(10)

print("")
print("")

def fib_rec(n):
    if n == 1: return 1
    elif n == 2: return 2
    elif n>2: return fib_rec(n-1) + fib_rec(n-2)

print(fib_rec())