# 1.
Add two numbers
a, b = 5, 3
print("1. Sum:", a + b)
# 2. Subtract two numbers
print("2. Difference:", a - b)
# 3. Multiply two numbers
print("3. Product:", a * b)
# 4. Divide two numbers
print("4. Division:", a / b)
# 5. Find remainder
print("5. Remainder:", a % b)
# 6. Exponent
print("6. Power:", a ** b)
# 7. Floor division
print("7. Floor Division:", a // b)
# 8. Check even/odd
num = 7
print("8. Even/Odd:", "Even" if num % 2 == 0 else "Odd")
# 9. Swap numbers
x, y = 10, 20
x, y = y, x
print("9. After Swap:", x, y)
# 10. Compare numbers
print("10. Is a > b?", a > b)
# ------------------------------------
# Level 2: Logical & Membership
# ------------------------------------
# 11. Number between 10 and 50
n = 25
print("11. Between 10 and 50?", 10 < n < 50)
# 12. Number not in list
lst = [1, 2, 3, 4]
print("12. 10 not in list?", 10 not in lst)
# 13. OR operator
age, has_id = 15, True
print("13. OR operator:", age >= 18 or has_id)
# 14. String contains vowels
s = "hello"
print("14. Contains vowel?", any(v in s for v in "aeiou"))
# 15. Negate boolean
flag = True
print("15. Negation:", not flag)
# --------------------------
# Level 3: Lists
# --------------------------
# 16. Sum of list elements
nums = [1, 2, 3, 4, 5]
print("16. Sum:", sum(nums))
# 17. Maximum element
print("17. Max:", max(nums))
# 18. Reverse list (no slicing)
rev = []
for i in nums:
rev.insert(0, i)
print("18. Reverse:", rev)
# 19. Frequency of element
print("19. Count 3:", nums.count(3))
# 20. Bubble sort
arr = [5, 1, 4, 2, 8]
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("20. Bubble Sort:", arr)
# ----------------------------
# Level 4: Tuples & Sets
# ----------------------------
# 21. Tuple of student marks
marks = (90, 85, 78)
print("21. Marks Tuple:", marks)
# 22. Length of tuple
print("22. Length:", len(marks))
# 23. Check element in tuple
print("23. Is 85 present?", 85 in marks)
# 24. Union & Intersection
A, B = {1, 2, 3}, {3, 4, 5}
print("24. Union:", A | B)
print("24. Intersection:", A & B)
# 25. Remove duplicates
lst = [1, 2, 2, 3, 4, 4]
print("25. Unique:", list(set(lst)))
# -----------------------------
# Level 5: Dictionaries
# -----------------------------
# 26. Dictionary
students = {"A": 90, "B": 85}
print("26. Students:", students)
# 27. Update dictionary
students["A"] = 95
print("27. Updated:", students)
# 28. Char frequency
text = "banana"
freq = {}
for ch in text:
freq[ch] = freq.get(ch, 0) + 1
print("28. Char Frequency:", freq)
# 29. Max value key
print("29. Top Student:", max(students, key=students.get))
# 30. Merge dictionaries
d1 = {"x": 1, "y": 2}
d2 = {"y": 3, "z": 4}
merged = {**d1, **d2}
print("30. Merged:", merged)
# ----------------------------
# Level 6: Stack & Queue
# ----------------------------
# 31. Stack
stack = []
stack.append(10)
stack.append(20)
print("31. Stack Pop:", stack.pop())
# 32. Queue
queue = []
queue.append(10)
queue.append(20)
print("32. Queue Pop:", queue.pop(0))
# 33. Balanced parentheses
expr = "(()())"
stack, balanced = [], True
for ch in expr:
if ch == "(":
stack.append(ch)
elif ch == ")":
if not stack: balanced = False; break
stack.pop()
print("33. Balanced?", balanced and not stack)
# 34. Reverse string using stack
s = "hello"
stack = list(s)
rev = ""
while stack:
rev += stack.pop()
print("34. Reverse String:", rev)
# 35. Circular queue simulation
queue = [None]*5
front = rear = -1
rear = (rear+1)%5; queue[rear] = 10
rear = (rear+1)%5; queue[rear] = 20
front = (front+1)%5; print("35. Circular Queue Dequeue:", queue[front])
# --------------------------
# Level 7: String Operations
# --------------------------
# 36. Palindrome check
s = "madam"
print("36. Palindrome?", s == s[::-1])
# 37. Reverse words
sentence = "I love Python"
print("37. Reversed Words:", " ".join(sentence.split()[::-1]))
# 38. Count vowels & consonants
s = "python"
vowels = sum(1 for ch in s if ch in "aeiou")
consonants = len(s) - vowels
print("38. Vowels:", vowels, "Consonants:", consonants)
# 39. Longest word
sentence = "Python is powerful language"
words = sentence.split()
print("39. Longest Word:", max(words, key=len))
# 40. Remove special characters
import re
s = "he@llo!! wo##rld"
print("40. Clean String:", re.sub(r'[^a-zA-Z0-9 ]', '', s))
# ------------------------
# Level 8: Intermediate
# ------------------------
# 41. Fibonacci
n=7
a, b = 0, 1
print("41. Fibonacci:", end=" ")
for _ in range(n):
print(a, end=" ")
a, b = b, a+b
print()
# 42. Factorial recursion
def fact(n): return 1 if n==0 else n*fact(n-1)
print("42. Factorial(5):", fact(5))
# 43. Binary search
arr = [1, 3, 5, 7, 9]
target = 7
low, high = 0, len(arr)-1
found = False
while low <= high:
mid = (low+high)//2
if arr[mid] == target: found=True; break
elif arr[mid] < target: low = mid+1
else: high = mid-1
print("43. Binary Search:", "Found" if found else "Not Found")
# 44. Linear search
target = 9
print("44. Linear Search:", "Found" if target in arr else "Not Found")
# 45. Armstrong number
n = 153
print("45. Armstrong?", sum(int(d)**3 for d in str(n)) == n)
# -------------------------------
# Level 9: Advanced Structures
# -------------------------------
# 46. Priority queue
pq = []
pq.append(4); pq.append(1); pq.append(3)
pq.sort(reverse=True)
print("46. Priority Queue Pop:", pq.pop(0))
# 47. Group words by length
words = ["cat", "dog", "apple", "hi"]
groups = {}
for w in words:
groups.setdefault(len(w), []).append(w)
print("47. Grouped:", groups)
# 48. Unique common elements
a = [1, 2, 3, 4]
b = [3, 4, 5, 6]
print("48. Common Elements:", set(a) & set(b))
# 49. Matrix addition
A = [[1, 2], [3, 4]]
B = [[5, 6], [7, 8]]
C = [[A[i][j]+B[i][j] for j in range(len(A[0]))] for i in range(len(A))]
print("49. Matrix Sum:", C)
# 50. Graph adjacency list
graph = {
"A": ["B", "C"],
"B": ["A", "D"],
"C": ["A", "D"],
"D": ["B", "C"]
}
print("50. Graph:", graph)
