Sobes.tech
Intern

Given an array of integers, find a non-empty subarray (continuous subsequence) with a given sum target, or say it's impossible. # find_target ([9, -6, 5, 1, 4, -2], 10) -> (2, 4) def find_target(arr: list[int], target: int) -> tuple[int, int]: pass