Top 25 Python Interview Coding Questions

a, b = 5, 10
a, b = b, a
print(a, b)

def fact(n):
    if n == 0:
        return 1
    return n * fact(n-1)

print(fact(5))

n = 29
flag = True
for i in range(2, n//2 + 1):
    if n % i == 0:
        flag = False
        break
print('Prime' if flag else 'Not Prime')

s = 'hello'
print(s[::-1])

n = 121
print('Palindrome' if str(n)==str(n)[::-1] else 'Not Palindrome')

import math
print(math.gcd(24, 36))

a, b = 0, 1
for _ in range(10):
    print(a, end=' ')
    a, b = b, a + b

lst = [3,8,1,9,4]
print(max(lst))

lst = [10,20,30,40]
lst = sorted(set(lst), reverse=True)
print(lst[1])

arr = [5,1,4,2]
for i in range(len(arr)):
    for j in range(len(arr)-i-1):
        if arr[j] > arr[j+1]:
            arr[j], arr[j+1] = arr[j+1], arr[j]
print(arr)

import bisect
arr = [1,3,5,7,9]
x = 7
i = bisect.bisect_left(arr, x)
print('Found' if i < len(arr) and arr[i]==x else 'Not Found')

n = 123
print(sum(int(d) for d in str(n)))

s = 'hello'
print(len(s))

a = 'listen'
b = 'silent'
print('Anagram' if sorted(a)==sorted(b) else 'Not Anagram')

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

stack = []
stack.append(10)
stack.append(20)
print(stack.pop())

from collections import deque
q = deque()
q.append(10)
q.append(20)
print(q.popleft())

s = '(())'
stack = []
balanced = True
for c in s:
    if c == '(':
        stack.append(c)
    else:
        if not stack:
            balanced = False
            break
        stack.pop()
print('Balanced' if balanced and not stack else 'Not Balanced')

print(bin(10)[2:])

lst = [1,2,3,2]
seen = set()
for x in lst:
    if x in seen:
        print(x)
        break
    seen.add(x)

lst = [1,2,4,5]
n = 5
print(n*(n+1)//2 - sum(lst))

lst = [1,2,3,4,5]
k = 2
print(lst[k:] + lst[:k])

mat = [[1,2],[3,4]]
print(list(zip(*mat)))

n = 153
print('Armstrong' if sum(int(d)**3 for d in str(n))==n else 'Not Armstrong')

import gc
gc.collect()