def toolchanger(tools, start_index, target):
    n = len(tools)
    target_index = -1

    for i in range(n):
        if tools[i] == target:
            target_index = i
            break

    right_moves = (target_index - start_index + n) % n
    left_moves = (start_index - target_index + n) % n

    return min(right_moves, left_moves)

Check your mails ✅

import math

def largestAdjacentLCM(arr):
    lcm = lambda x, y: abs(x*y) // math.gcd(x, y)
    return max(lcm(arr[i], arr[i+1]) for i in range(len(arr) - 1))