Python Coding Interview Questions and Answers

def intersection(list1, list2):

  return list(set(list1) & set(list2))

import numpy as np

matrix1 = np.array([[1, 2], [3, 4]])

matrix2 = np.array([[5, 6], [7, 8]])

result = np.dot(matrix1, matrix2)

def fibonacci_generator():

  a, b = 0, 1

  while True:

    yield a

    a, b = b, a + b

def dfs(graph, node, visited):

  if node not in visited:

    print(node)

    visited.add(node)

    for neighbor in graph[node]:

      dfs(graph, neighbor, visited)

class TreeNode:
 def __init__(self, value):
 self.value = value
 self.left = None
 self.right = None

def is_balanced(root):
 if root is None:
 return True
 left_height = height(root.left)
 right_height = height(root.right)
 return abs(left_height - right_height) <= 1 and is_balanced(root.left) and is_balanced(root.right)

def height(node):
 if node is None:
 return 0
 return max(height(node.left), height(node.right)) + 1

from collections import OrderedDict

class LRUCache:
 def __init__(self, capacity):
 self.cache = OrderedDict()
 self.capacity = capacity

 def get(self, key):
 if key in self.cache:
 self.cache.move_to_end(key)
 return self.cache[key]
 return -1

 def put(self, key, value):
 if len(self.cache) >= self.capacity:
 self.cache.popitem(last=False)
 self.cache[key] = value
 self.cache.move_to_end(key)