


from __future__ import annotations

def 		snake_case_   (				lowercase__     :    str       ,     lowercase__     :    Tuple     ):






				'''simple docstring'''






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


if __name__ == "__main__":
		import doctest

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



from __future__ import annotations


def  A			(   lowercase       ,			lowercase					)  ->    int:
		'''simple docstring'''

		UpperCamelCase      ,    UpperCamelCase            =	0, len(lowercase					) - 1
		while start_ind <= end_ind:
				if array[start_ind] == search_item:
						return start_ind
				elif array[end_ind] == search_item:
						return end_ind
				else:
						start_ind += 1
						end_ind -= 1
    # returns -1 if search_item is not found in array
		return -1


if __name__ == "__main__":
					print(double_linear_search(list(range(100)), 40))
