Python – Convert List of Lists to Tuple of Tuples

Sometimes, while working with Python data, we can have a problem in which we need to perform interconversion of data types. This kind of problem can occur in domains in which we need to get data in particular formats such as Machine Learning. Let us discuss certain ways in which this task can be performed.

Input : test_list = [['Best'], ['Gfg'], ['Gfg']] 
Output : (('Best', ), ('Gfg', ), ('Gfg', )) 

Input : test_list = [['Gfg', 'is', 'Best']] 
Output : (('Gfg', 'is', 'Best'), )

Method #1: Using tuple() + list comprehension

The combination of the above functions can be used to solve this problem. In this, we perform the conversion using tuple(), and list comprehension is used to extend the logic to all the containers. 

The original list is : [['Gfg', 'is', 'Best'], ['Gfg', 'is', 'love'], ['Gfg', 'is', 'for', 'Geeks']]
The converted data : (('Gfg', 'is', 'Best'), ('Gfg', 'is', 'love'), ('Gfg', 'is', 'for', 'Geeks'))

Time complexity: O(n*m), where n is the length of the input list and m is the length of the longest sublist.
Auxiliary Space: O(n*m), as the program creates a new tuple for each sublist in the input list, and each tuple contains the elements of the corresponding sublist. Therefore, the space used is proportional to the total number of elements in the input list.

Method #2 : Using map() + tuple() 

The combination of the above functions can be used to solve this problem. In this, we perform the task performed using list comprehension using map(), to extend the conversion logic to each sublist. 

The original list is : [['Gfg', 'is', 'Best'], ['Gfg', 'is', 'love'], ['Gfg', 'is', 'for', 'Geeks']]
The converted data : (('Gfg', 'is', 'Best'), ('Gfg', 'is', 'love'), ('Gfg', 'is', 'for', 'Geeks'))

Time complexity: O(n*m), where n is the number of sublists in the input list and m is the maximum length of a sublist. 
Auxiliary space: O(n*m), since the tuple() function creates a new tuple for each sublist in the input list, and each tuple contains m elements. 

Method #3: Using enumerate function 

(('Gfg', 'is', 'Best'), ('Gfg', 'is', 'love'), ('Gfg', 'is', 'for', 'Geeks'))

Time complexity: O(N*M), where N is the length of test_list and M is the maximum length of a sublist in test_list. 
Auxiliary space: O(N*M) 

Method#4: Using Recursive method

Algorithm:

1. Define the function list_to_tuple(lst) that takes a list lst as input.
2. Check if the length of the list is 0. If it is, return an empty tuple ().
3. If lst is not empty, convert the first element of list to a tuple using the tuple function, and add it to the result of calling list_to_tuple recursively on the rest of list.
4. Return the tuple obtained in step 3.

The original list is : [['Gfg', 'is', 'Best'], ['Gfg', 'is', 'love'], ['Gfg', 'is', 'for', 'Geeks']]
The converted data : (('Gfg', 'is', 'Best'), ('Gfg', 'is', 'love'), ('Gfg', 'is', 'for', 'Geeks'))

Time complexity:O(N), The function list_to_tuple is called recursively on a list that is one element smaller than the previous list, until the length of the list becomes 0. The number of times the function is called recursively is equal to the length of the input list. Therefore, the time complexity of the function is O(n), where n is the length of the input list.

Auxiliary space:O(N), The function list_to_tuple uses a constant amount of space to store the empty tuple (), which is returned when the input list is empty. In addition, the function creates a tuple for each element in the input list using the tuple function. Since each tuple created in the function is of the same length as the input list, the space complexity of the function is O(n), where n is the length of the input list.

Method #5: Using nested loops

1. Iterate through each element of each sublist in the original list of lists. 
2. For each sublist, it creates a new tuple by iterating through the elements of the sublist and adding each element to the tuple. 
3. It then appends the new tuple to a new list before creating a final tuple containing all the sub-tuples.

The original list is : [['Gfg', 'is', 'Best'], ['Gfg', 'is', 'love'], ['Gfg', 'is', 'for', 'Geeks']]
The converted data : (('Gfg', 'is', 'Best'), ('Gfg', 'is', 'love'), ('Gfg', 'is', 'for', 'Geeks'))

Time complexity: O(n^2) where n is the number of elements in the list of lists. 
Auxiliary Space: O(n^2) because we are creating a new tuple for each sublist and then adding those tuples to a new list before creating a final tuple containing all the sub-tuples.

Method #6: Using itertools.starmap()

Approach:

1. Import the itertools module.
2. Define a function that accepts a list and returns a tuple of the same list.
3. Pass the list of lists as an argument to the itertools.starmap() function along with the function defined in step 2.
4. Convert the output of step 3 to a tuple using the tuple() function.
5. Store the result in a variable and print it.

The original list is : [['Gfg', 'is', 'Best'], ['Gfg', 'is', 'love'], ['Gfg', 'is', 'for', 'Geeks']]
The converted data : (('Gfg', 'is', 'Best'), ('Gfg', 'is', 'love'), ('Gfg', 'is', 'for', 'Geeks'))

Time complexity: O(n), where n is the total number of elements in the input list of lists.
Auxiliary space: O(n), where n is the total number of elements in the input list of lists.

Method #7: Using a nested list comprehension and zip() function

This method involves using a nested list comprehension to iterate over the nested list and convert each inner list to a tuple. The zip function is then used to transpose the resulting list of tuples into a tuple of tuples.

Steps:

1. Define a function named list_to_tuple that takes a single argument, lst.
2. Use a nested list comprehension to iterate over the nested list and convert each inner list to a tuple.
3. Use the zip function to transpose the resulting list of tuples into a tuple of tuples.
4. Return the resulting tuple of tuples.

The original list is : [['Gfg', 'is', 'Best'], ['Gfg', 'is', 'love'], ['Gfg', 'is', 'for', 'Geeks']]
The converted data : (('Gfg', 'is', 'Best'), ('Gfg', 'is', 'love'), ('Gfg', 'is', 'for', 'Geeks'))

Time complexity: O(n^2), where n is the length of the nested list.
Auxiliary space: O(n^2), for storing the tuple of tuples.