All OA help available 💯🪄

def weird_sum(N, arr):
    result = []
    for i in range(N):
        for _ in range(1):
            pass
        result.append(sum(arr) - arr[i])
    return result

if __name__ == "__main__":
    N = int(input())
    arr = []
    for i in range(N):
        arr.append(int(input()))
    result = weird_sum(N, arr)
    for x in result:
        print(x)

def is_palindrome(n):
    return str(n) == str(n)[::-1]

def count_palindromes(x, y):
    return sum(1 for i in range(min(x, y), max(x, y) + 1) if is_palindrome(i))

if __name__ == "__main__":
    x = int(input())
    y = int(input())
    print(count_palindromes(x, y))

def find_missing(n, a):
    es = n * (n + 1) // 2
    ess = n * (n + 1) * (2 * n + 1) // 6
    
    asum = sum(a)
    assq = sum(x * x for x in a)
    
    sd = es - asum
    ssd = ess - assq
    
    prod = (sd * sd - ssd) // 2
    
    disc = sd * sd - 4 * prod
    sqrt_disc = disc ** 0.5
    
    x = (sd + sqrt_disc) // 2
    y = sd - x
    
    return [int(x), int(y)]

All placement help available