Given an integer array `numbers` and an integer `target`, find (`i`, `j`) such that `numbers[i] + numbers[j] == target`

find-sum.py

from ast import literal_eval
from collections import deque
from typing import Callable, Iterable

from more_itertools import is_sorted


def solve_sorted(numbers: Iterable[int], target: int) -> tuple[int, int] | None:
    values = deque(numbers)
    start = 0
    while len(values) >= 2:
        s = values[0] + values[-1]
        if s < target:
            values.popleft()
        elif s > target:
            values.pop()
        else:
            return start, start + len(values) - 1
    return None

def solve_unsorted(numbers: Iterable[int], target: int) -> tuple[int, int] | None:
    indices = {v: i for i, v in enumerate(numbers)}
    for v, i in indices.items():
        co = target - v
        co_i = indices.get(co)
        if co_i is None:
            continue
        return i, co_i
    return None


def main():
    numbers = literal_eval(input("\x1b[1mnumbers\x1b[m = "))
    target = literal_eval(input("\x1b[1mtarget\x1b[m = "))

    solve: Callable[[Iterable[int], int], tuple[int, int] | None]
    if is_sorted(numbers):
        print("\x1b[32msorted\x1b[m")
        solve = solve_sorted
    else:
        print("\x1b[31munsorted\x1b[m")
        solve = solve_unsorted

    print("\x1b[1mResult\x1b[m:", solve(numbers, target))


if __name__ == "__main__":
    main()