




from __future__ import annotations


def 							__SCREAMING_SNAKE_CASE  (      snake_case_     ,   snake_case_     ,   snake_case_						):

						'''simple docstring'''


						if len(snake_case_						) == 0:
												raise ValueError("find_min() arg is an empty sequence"						)
						if (
						    left >= len(snake_case_						)
						    or left < -len(snake_case_						)
						    or right >= len(snake_case_						)
						    or right < -len(snake_case_						)
						):
												raise IndexError("list index out of range"						)
						if left == right:
												return nums[left]
						_UpperCAmelCase													=					(left + right) >> 1  # the middle
						_UpperCAmelCase													=					find_min(snake_case_     ,   snake_case_     ,   snake_case_						)  # find min in range[left, mid]
						_UpperCAmelCase													=					find_min(snake_case_     ,   mid + 1     ,   snake_case_						)  # find min in range[mid + 1, right]

						return left_min if left_min <= right_min else right_min


if __name__ == "__main__":
				import doctest

				doctest.testmod(verbose=True)










from __future__ import annotations


def 							__SCREAMING_SNAKE_CASE  (      snake_case_     ,   snake_case_						):

						'''simple docstring'''


						_UpperCAmelCase													=					{}
						for index, val in enumerate(snake_case_						):
												_UpperCAmelCase													=					target - val
												if compl in chk_map:
																		return [chk_map[compl], index]
												_UpperCAmelCase													=					index
						return []


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				print(f"""{two_sum([2, 7, 11, 15], 9) = }""")




