
def     lowercase__						(					lowerCAmelCase				:					str ,				lowerCAmelCase				:					str ) ->      int:






    """simple docstring"""




    assert x is not None
    assert y is not None

    UpperCAmelCase									=					len(lowerCAmelCase )
    UpperCAmelCase									=					len(lowerCAmelCase )

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

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

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

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

        if l[i][j] == l[i - 1][j - 1] + match:
            if match == 1:
                UpperCAmelCase									=					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__":
   SCREAMING_SNAKE_CASE_    					=						'''AGGTAB'''
   SCREAMING_SNAKE_CASE_    					=						'''GXTXAYB'''
   SCREAMING_SNAKE_CASE_    					=						4
   SCREAMING_SNAKE_CASE_    					=						'''GTAB'''

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

   doctest.testmod()





"""simple docstring"""

from __future__ import annotations

import numpy as np




def     lowercase__						(					lowerCAmelCase				:					list[float] ) ->      Dict:






    """simple docstring"""




    return np.maximum(0 ,				lowerCAmelCase )


if __name__ == "__main__":
   print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]



