Python – Test if Tuple contains K

Sometimes, while working with Python, we can have a problem in which we have a record and we need to check if it contains K. This kind of problem is common in data preprocessing steps. Let’s discuss certain ways in which this task can be performed.

Method #1: Using any() + map() + lambda Combination of above functions can be used to perform this task. In this, we check for any element using any() and extension of logic is done by map() and lambda. 

The original tuple : (10, 4, 5, 6, 8)
Does tuple contain any K value ? : True

Method #2: Using loop This task can be performed using loop as well using brute force constructs. We just iterate through the tuple and when we encounter K, we set flag to True and break. 

The original tuple : (10, 4, 5, 6, 8)
Does tuple contain any K value ? : True

Method #3: Using in operator

The original tuple : (10, 4, 5, 6, 8)
Does tuple contain any K value ? : True

Method #4 : Using operator.countOf() method

The original tuple : (10, 4, 5, 6, 8)
Does tuple contain any K value ? : True

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

Method #5: Using set()

The original tuple : (10, 4, 5, 6, 8)
Does tuple contain any K value ? : True

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

Method #6: Using the set intersections() function and bool() function 

Step-by-step approach:

• Initialize the tuple to be checked.
• Print the original tuple.
• Initialize the value of K that needs to be checked in the tuple.
• Check if the tuple contains the value K using set() and intersection().
• Convert the tuple to a set using the set() method.
• Create a set with the value K and use the intersection() method to check if there is any common element in the two sets.
• If the intersection contains any element, then the tuple contains the value K.
• Print the result whether the tuple contains K or not.

The original tuple : (10, 4, 5, 6, 8)
Does tuple contain any K value ? : True

Time Complexity: The time complexity of this approach is O(n) since we need to check all the elements of the tuple once.
Auxiliary Space: The space complexity of this approach is O(n) since we need to create a set of size n to store the elements of the tuple.

Method #7: Using index() method

• Initialize the tuple and K value as given in the problem statement.
• Use the index() method to check if the K value is present in the tuple.
• If the K value is present in the tuple, index() method will return its index position, which is greater than or equal to 0.
• If the K value is not present in the tuple, index() method will raise a ValueError exception.
• Catch the exception using a try-except block and return False.
• If no exception is raised, return True.

The original tuple : (10, 4, 5, 6, 8)
Does tuple contain any K value ? : True

Time complexity: O(n), where n is the length of the tuple.
Auxiliary space: O(1), as we are not using any extra data structure.