
'''simple docstring'''
from __future__ import annotations




def       _UpperCamelCase	(					SCREAMING_SNAKE_CASE__   ,					SCREAMING_SNAKE_CASE__ )     ->       int:


		'''simple docstring'''


		snake_case     :					Optional[Any]     =	0, len(SCREAMING_SNAKE_CASE__ ) - 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(1_0_0)), 4_0))




'''simple docstring'''
import itertools
from pathlib import Path




def       _UpperCamelCase	(					SCREAMING_SNAKE_CASE__ )     ->       int:


		'''simple docstring'''


		snake_case     :					Optional[Any]     =	[tuple(SCREAMING_SNAKE_CASE__ ) for login in logins]

		snake_case     :					Dict     =	{char for login in split_logins for char in login}

		for permutation in itertools.permutations(SCREAMING_SNAKE_CASE__ ):
				snake_case     :					Optional[int]     =	True
				for login in logins:
						if not (
						    permutation.index(login[0] )
						    < permutation.index(login[1] )
						    < permutation.index(login[2] )
						):
								snake_case     :					int     =	False
								break

				if satisfied:
						return int(''''''.join(SCREAMING_SNAKE_CASE__ ) )

		raise Exception('''Unable to find the secret passcode''' )




def       _UpperCamelCase	(					SCREAMING_SNAKE_CASE__ = "keylog.txt" )     ->       int:


		'''simple docstring'''


		snake_case     :					Optional[Any]     =	Path(SCREAMING_SNAKE_CASE__ ).parent.joinpath(SCREAMING_SNAKE_CASE__ ).read_text().splitlines()

		return find_secret_passcode(SCREAMING_SNAKE_CASE__ )


if __name__ == "__main__":
						print(f"{solution() = }")


