
def 		lowercase_    (     A__				,	A__	)							->							str:
    """simple docstring"""

    snake_case				  =      len(A__	)
    snake_case				  =      len(A__	)
    snake_case				  =      (
        first_str_length if first_str_length > second_str_length else second_str_length
    )
    snake_case				  =      []
    for char_count in range(A__	):
        if char_count < first_str_length:
            output_list.append(first_str[char_count]	)
        if char_count < second_str_length:
            output_list.append(second_str[char_count]	)
    return "".join(A__	)


if __name__ == "__main__":
   print(alternative_string_arrange("AB", "XYZ"), end=" ")



def 		lowercase_    (     A__				,	A__	)							->							List[Any]:
    """simple docstring"""

    snake_case				  =      [0 for i in range(r + 1	)]
    # nc0 = 1
    snake_case				  =      1
    for i in range(1				,	n + 1	):
        # to compute current row from previous row.
        snake_case				  =      min(A__				,	A__	)
        while j > 0:
            c[j] += c[j - 1]
            j -= 1
    return c[r]





print(binomial_coefficient(n=10, r=5))

