
'''simple docstring'''





from __future__ import annotations





def     snake_case							(						UpperCAmelCase ,					UpperCAmelCase		)->     int:







      """simple docstring"""
      __A		, __A    		=     0, len(UpperCAmelCase		) - 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     snake_case							(						UpperCAmelCase		)->     int:







      """simple docstring"""
      __A    		=     [tuple(UpperCAmelCase		) for login in logins]

      __A    		=     {char for login in split_logins for char in login}

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

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

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





def     snake_case							(						UpperCAmelCase = "keylog.txt"		)->     int:







      """simple docstring"""
      __A    		=     Path(UpperCAmelCase		).parent.joinpath(UpperCAmelCase		).read_text().splitlines()

      return find_secret_passcode(UpperCAmelCase		)


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






