def 			__SCREAMING_SNAKE_CASE						(      __UpperCamelCase					: str				,  __UpperCamelCase					: str			)							->      Any:







  """simple docstring"""





  assert x is not None
  assert y is not None

  SCREAMING_SNAKE_CASE__    							=   len(__UpperCamelCase			)
  SCREAMING_SNAKE_CASE__    							=   len(__UpperCamelCase			)

  # declaring the array for storing the dp values
  SCREAMING_SNAKE_CASE__    							=   [[0] * (n + 1) for _ in range(m + 1			)]  # noqa: E741

  for i in range(1				,  m + 1			):
    for j in range(1				,  n + 1			):
      SCREAMING_SNAKE_CASE__    							=   1 if x[i - 1] == y[j - 1] else 0

      SCREAMING_SNAKE_CASE__    							=   max(l[i - 1][j]				,  l[i][j - 1]				,  l[i - 1][j - 1] + match			)

  SCREAMING_SNAKE_CASE__    							=   """"""
  SCREAMING_SNAKE_CASE__							,  SCREAMING_SNAKE_CASE__    							=   m, n
  while i > 0 and j > 0:
    SCREAMING_SNAKE_CASE__    							=   1 if x[i - 1] == y[j - 1] else 0

    if l[i][j] == l[i - 1][j - 1] + match:
      if match == 1:
        SCREAMING_SNAKE_CASE__    							=   x[i - 1] + seq
      i -= 1
      j -= 1
    elif l[i][j] == l[i - 1][j]:
      i -= 1
    else:
      j -= 1

  return l[m][n], seq


if __name__ == "__main__":
   __lowerCamelCase    :				Any							     =	'''AGGTAB'''
   __lowerCamelCase    :				int							     =	'''GXTXAYB'''
   __lowerCamelCase    :				Optional[int]							     =	4
   __lowerCamelCase    :				Tuple							     =	'''GTAB'''

   __lowerCamelCase    :				Dict							     =	longest_common_subsequence(a, b)
   print('''len =''', ln, ''', sub-sequence =''', subseq)
   import doctest

   doctest.testmod()

from __future__ import annotations



def 			__SCREAMING_SNAKE_CASE						(      __UpperCamelCase					: list			)							->      float:







  """simple docstring"""





  if not nums:
    raise ValueError("""List is empty"""			)
  return sum(__UpperCamelCase			) / len(__UpperCamelCase			)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
