Python - Filter Tuples with Strings of specific characters

Given a Tuple List, extract tuples, which have strings made up of certain characters.

Input : test_list = [('gfg', 'best'), ('gfg', 'good'), ('fest', 'gfg')], char_str = 'gfestb' 
Output : [('gfg', 'best'), ('fest', 'gfg')] 
Explanation : All tuples contain characters from char_str.

Input : test_list = [('gfg', 'best'), ('gfg', 'good'), ('fest', 'gfg')], char_str = 'gfstb' 
Output : [] 
Explanation : No tuples with given characters. 

Method #1 : Using all() + list comprehension

In this, we check for characters in strings, using in operator and all() is used to check if all elements in tuple have strings made up of certain characters.

The original list is : [('gfg', 'best'), ('gfg', 'good'), ('fest', 'gfg')]
The filtered tuples : [('gfg', 'best'), ('fest', 'gfg')]

Time Complexity: O(n²)
Auxiliary Space: O(n)

Method #2 : Using filter() + lambda + all()

Similar to the above method, difference being filter() + lambda is used to perform task of filtering.

The original list is : [('gfg', 'best'), ('gfg', 'good'), ('fest', 'gfg')]
The filtered tuples : [('gfg', 'best'), ('fest', 'gfg')]

Time Complexity: O(n²)
Auxiliary Space: O(n)

Method #3 : Using replace(),join() and len() methods

The original list is : [('gfg', 'best'), ('gfg', 'good'), ('fest', 'gfg')]
The filtered tuples : [('gfg', 'best'), ('fest', 'gfg')]

Time complexity: O(n*m), where n is the length of the input list and m is the length of the char_str.
Auxiliary space: O(k), where k is the number of tuples that satisfy the condition, as we are storing those tuples in a new list.

Method #4 : Using re

One approach to solve this problem is using a regular expression. The idea is to join the tuples into a single string and then use re.search to check if all characters are in the character string. Here is the code:

[('gfg', 'best'), ('fest', 'gfg')]

Time complexity: O(n^2)
Auxiliary Space: O(n)

Method #5: Using Set Operations

Initialize the input list and the characters string.
Convert the characters string into a set for faster lookups.
Iterate through each tuple in the input list.
Convert each tuple into a set of characters.
Use the set intersection operation to find the common characters between the tuple and the characters string.
Check if the length of the intersection set is equal to the length of the tuple. If it is, then all the characters in the tuple are present in the characters string.
If step 6 is true, append the tuple to the result list.
Return the result list.

The original list is : [('gfg', 'best'), ('gfg', 'good'), ('fest', 'gfg')]
The filtered tuples : [('gfg', 'best'), ('fest', 'gfg')]

Time complexity: O(n*m), where n is the number of tuples and m is the length of the longest tuple. In the worst case, we need to iterate through every character in every tuple.
Auxiliary space: O(m), where m is the length of the longest tuple. We need to create a set for each tuple.