






def   lowerCamelCase__			(     lowercase				):

  """simple docstring"""






  SCREAMING_SNAKE_CASE       :      Union[str, Any]							=    [0] * len(lowercase				)

  for i in range(1						,     len(lowercase				)				):
    # use last results for better performance - dynamic programming
    SCREAMING_SNAKE_CASE       :      List[Any]							=    prefix_result[i - 1]
    while j > 0 and input_string[i] != input_string[j]:
      SCREAMING_SNAKE_CASE       :      str							=    prefix_result[j - 1]

    if input_string[i] == input_string[j]:
      j += 1
    SCREAMING_SNAKE_CASE       :      List[str]							=    j

  return prefix_result


def   lowerCamelCase__			(     lowercase				):

  """simple docstring"""






  return max(prefix_function(lowercase				)				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()














def   lowerCamelCase__			(     lowercase						,     lowercase				):

  """simple docstring"""






  return numa ^ numa < 0


if __name__ == "__main__":
   import doctest

   doctest.testmod()






