

'''simple docstring'''




from __future__ import annotations




def 						UpperCamelCase	(			a			)				->     int:






     '''simple docstring'''
     __magic_name__						       =    len(lowerCamelCase_			) // 2

     # choose the middle 3 elements
     __magic_name__						       =    lst[m - 1 : m + 2]

     # if middle element is peak
     if three[1] > three[0] and three[1] > three[2]:
          return three[1]

     # if increasing, recurse on right
     elif three[0] < three[2]:
          if len(lst[:m]			) == 2:
               m -= 1
          return peak(lst[m:]			)

     # decreasing
     else:
          if len(lst[:m]			) == 2:
               m += 1
          return peak(lst[:m]			)


if __name__ == "__main__":
  import doctest

  doctest.testmod()









'''simple docstring'''




import functools




def 						UpperCamelCase	(			a		,						a			)				->     int:






     '''simple docstring'''
     __magic_name__						       =    len(a			)
     __magic_name__						       =    len(a			)

     @functools.cache
     def min_distance(a		,						a			) -> int:
          # if first word index is overflow - delete all from the second word
          if indexa >= len_worda:
               return len_worda - indexa
          # if second word index is overflow - delete all from the first word
          if indexa >= len_worda:
               return len_worda - indexa
          __magic_name__						       =    int(worda[indexa] != worda[indexa]			)  # current letters not identical
          return min(
              1 + min_distance(indexa + 1		,						a			)		,						1 + min_distance(a		,						indexa + 1			)		,						diff + min_distance(indexa + 1		,						indexa + 1			)		,						)

     return min_distance(0		,						0			)


if __name__ == "__main__":
      import doctest

      doctest.testmod()






