

from __future__ import annotations

def      a__	(						UpperCAmelCase				:     list[int]							,					UpperCAmelCase				:     int     )    ->		list[int]:
  UpperCAmelCase			:				dict[int, int]										=					{}
  for index, val in enumerate(UpperCAmelCase     ):
    UpperCAmelCase			:				Optional[int]										=					target - val
    if compl in chk_map:
      return [chk_map[compl], index]
    UpperCAmelCase			:				List[Any]										=					index
  return []


if __name__ == "__main__":
     import doctest

     doctest.testmod()
     print(f"""{two_sum([2, 7, 1_1, 1_5], 9) = }""")









import sys



def      __lowerCAmelCase    (				snake_case						:     int    ,   snake_case						:     list[int]			)							->				int:
   if not numbers:
      return 0
   if target == 0 and target in numbers:
      return 0
   if not isinstance(snake_case    ,   (list, tuple)			) or not all(
       isinstance(snake_case    ,   snake_case			) for number in numbers			):
      raise ValueError("""numbers must be an iterable of integers"""			)

   __lowerCamelCase:					Union[str, Any]	 =						0
   __lowerCamelCase:					str	 =						sys.maxsize

   while right < len(snake_case			):
      curr_sum += numbers[right]
      while curr_sum >= target and left <= right:
         __lowerCamelCase:					str	 =						min(snake_case    ,   right - left + 1			)
         curr_sum -= numbers[left]
         left += 1
      right += 1

   return 0 if min_len == sys.maxsize else min_len


