Python вопросы с собеседований

def fibonacci(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        a, b = 0, 1
        for _ in range(2, n + 1):
            a, b = b, a + b
        return b

# Тестирование
print(fibonacci(10))  # 55
print(fibonacci(15))  # 610

print(f"x = {x}, y = {y}, z = {z}")

print(f"{x=}, {y=}, {z=}")

x=42, y='hello', z=[1, 2, 3]

print(f"{(n := len(mylist))=}")

n=5

import time
from threading import Thread

@smart_cache(maxsize=100, strategy='LRU', ttl=300, collect_stats=True)
def fibonacci(n):
    if n < 2:
        return n
    return fibonacci(n-1) + fibonacci(n-2)

class MathUtils:
    @smart_cache(maxsize=50, strategy='LFU', ttl=600)
    def expensive_calc(self, x, y):
        time.sleep(0.1)  # Имитация тяжелых вычислений
        return x ** y + y ** x

# Использование
print(fibonacci(10))  # Вычисление
print(fibonacci(10))  # Из кэша

# Получение статистики
stats = fibonacci.cache_stats()
print(f"Cache hits: {stats['hits']}, misses: {stats['misses']}")

# Принудительная очистка
fibonacci.cache_clear()

# Многопоточное использование
def worker():
    for i in range(5):
        fibonacci(i)

threads = [Thread(target=worker) for _ in range(3)]
for t in threads:
    t.start()
for t in threads:
    t.join()

funcs = []

for i in range(3):
    def f():
        return i
    funcs.append(f)

results = [func() for func in funcs]
print(results)

[0, 1, 2]

[2, 2, 2]

funcs = []

for i in range(3):
    def f(i=i):
        return i
    funcs.append(f)

results = [func() for func in funcs]
print(results)  # [0, 1, 2]

def append_to_list(value, my_list=[]):
    my_list.append(value)
    return my_list

print(append_to_list(1))
print(append_to_list(2))
print(append_to_list(3))

[1]
[2]
[3]

python 
[1]
[1, 2]
[1, 2, 3]

def append_to_list(value, my_list=None):
    if my_list is None:
        my_list = []
    my_list.append(value)
    return my_list

[1]
[2]
[3]