





'''simple docstring'''

def 						UpperCamelCase				(							_lowerCamelCase					:					bytes       ):
    return "".join([hex(_lowerCamelCase       )[2:].zfill(2       ).upper() for byte in list(_lowerCamelCase       )]       )





def 						UpperCamelCase				(							_lowerCamelCase					:					str       ):
    # Check data validity, following RFC3548
    # https://www.ietf.org/rfc/rfc3548.txt
    if (len(_lowerCamelCase       ) % 2) != 0:
        raise ValueError(
            "Base16 encoded data is invalid:\nData does not have an even number of hex digits."       )
    # Check the character set - the standard base16 alphabet
    # is uppercase according to RFC3548 section 6
    if not set(_lowerCamelCase       ) <= set("0123456789ABCDEF"       ):
        raise ValueError(
            "Base16 encoded data is invalid:\nData is not uppercase hex or it contains invalid characters."       )
    # For every two hexadecimal digits (= a byte), turn it into an integer.
    # Then, string the result together into bytes, and return it.
    return bytes(int(data[i] + data[i + 1]						,       16       ) for i in range(0						,       len(_lowerCamelCase       )						,       2       )       )


if __name__ == "__main__":
  import doctest

  doctest.testmod()










'''simple docstring'''

import functools





def 						UpperCamelCase				(							_lowerCamelCase					:					str						,       _lowerCamelCase					:					str       ):
    A__				=			len(_lowerCamelCase       )
    A__				=			len(_lowerCamelCase       )

    @functools.cache
    def min_distance(_lowerCamelCase					:					int						,       _lowerCamelCase					:					int       ) -> 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
        A__				=			int(worda[indexa] != worda[indexa]       )  # current letters not identical
        return min(
            1 + min_distance(indexa + 1						,       _lowerCamelCase       )						,       1 + min_distance(_lowerCamelCase						,       indexa + 1       )						,       diff + min_distance(indexa + 1						,       indexa + 1       )						,       )

    return min_distance(0						,       0       )


if __name__ == "__main__":
  import doctest

  doctest.testmod()



