Python Coding Pertanyaan dan Jawaban Wawancara

def fibonacci(n):

  if n <= 1:

    return n

  else:

    return fibonacci(n-1) + fibonacci(n-2)

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)