def 			UpperCamelCase__						(    A__      ,			A__   )       -> list:
				snake_case__ :     int 							=				len(A__   )
				snake_case__ :     int 							=				len(A__   )
				snake_case__ :     int 							=				(
				    first_input_list_length
				    if first_input_list_length > second_input_list_length
				    else second_input_list_length
				)
				snake_case__ :     list 							=				[]
				for char_count in range(A__   ):
								if char_count < first_input_list_length:
												output_result_list.append(first_input_list[char_count]   )
								if char_count < second_input_list_length:
												output_result_list.append(second_input_list[char_count]   )

				return output_result_list


if __name__ == "__main__":
				print(alternative_list_arrange(['''A''', '''B''', '''C'''], [1, 2, 3, 4, 5]), end=''' ''')



from __future__ import annotations

import random

# Adjacency list representation of this graph:
# https://en.wikipedia.org/wiki/File:Single_run_of_Karger%E2%80%99s_Mincut_algorithm.svg
lowerCAmelCase__					:       Dict		=       {
    '''1''': ['''2''', '''3''', '''4''', '''5'''],
    '''2''': ['''1''', '''3''', '''4''', '''5'''],
    '''3''': ['''1''', '''2''', '''4''', '''5''', '''10'''],
    '''4''': ['''1''', '''2''', '''3''', '''5''', '''6'''],
    '''5''': ['''1''', '''2''', '''3''', '''4''', '''7'''],
    '''6''': ['''7''', '''8''', '''9''', '''10''', '''4'''],
    '''7''': ['''6''', '''8''', '''9''', '''10''', '''5'''],
    '''8''': ['''6''', '''7''', '''9''', '''10'''],
    '''9''': ['''6''', '''7''', '''8''', '''10'''],
    '''10''': ['''6''', '''7''', '''8''', '''9''', '''3'''],
}
def 			UpperCamelCase__						(    A__   )       -> set[tuple[str, str]]:
				snake_case__ :     Tuple 							=				{node: {node} for node in graph}

				snake_case__ :     Tuple 							=				{node: graph[node][:] for node in graph}

				while len(A__   ) > 2:
								# Choose a random edge.
								snake_case__ :     Union[str, Any] 							=				random.choice(list(graph_copy.keys()   )   )
								snake_case__ :     Any 							=				random.choice(graph_copy[u]   )

								# Contract edge (u, v) to new node uv
								snake_case__ :     Tuple 							=				u + v
								snake_case__ :     Dict 							=				list(set(graph_copy[u] + graph_copy[v]   )   )
								uv_neighbors.remove(A__   )
								uv_neighbors.remove(A__   )
								snake_case__ :     Optional[Any] 							=				uv_neighbors
								for neighbor in uv_neighbors:
												graph_copy[neighbor].append(A__   )

								snake_case__ :     Tuple 							=				set(contracted_nodes[u].union(contracted_nodes[v]   )   )

								# Remove nodes u and v.
								del graph_copy[u]
								del graph_copy[v]
								for neighbor in uv_neighbors:
												if u in graph_copy[neighbor]:
																graph_copy[neighbor].remove(A__   )
												if v in graph_copy[neighbor]:
																graph_copy[neighbor].remove(A__   )

    # Find cutset.
				snake_case__ :     Tuple 							=				[contracted_nodes[node] for node in graph_copy]
				return {
				    (node, neighbor)
				    for node in groups[0]
				    for neighbor in graph[node]
				    if neighbor in groups[1]
				}


if __name__ == "__main__":
				print(partition_graph(TEST_GRAPH))


