Python program to find common elements in three lists using sets

Prerequisite: Sets in Python Given three arrays, we have to find common elements in three sorted lists using sets. Examples :

Input : ar1 = [1, 5, 10, 20, 40, 80]
        ar2 = [6, 7, 20, 80, 100]
        ar3 = [3, 4, 15, 20, 30, 70, 80, 120]

Output : [80, 20]

Input : ar1 = [1, 5, 5]
        ar2 = [3, 4, 5, 5, 10]
        ar3 = [5, 5, 10, 20]

Output : [5]

Method 1: We have given three arrays, with the help of sets one can easily find out the intersection of these Arrays. Intersection method simply provides the intersection of both the arrays upon which you want to perform the operation of intersection (or, it simply gives out the common elements in both the array). We will be taking three arrays and then we will take out the intersection. Below is the implementation of above approach : 

[80, 20]

Time complexity: O(n), where n is the size of the largest input array.
Auxiliary space: O(m), where m is the size of the resulting set.

Method 2: Using Set

One alternative approach using sets is to iterate over the elements in one of the lists and check if they are present in the other two lists using the in operator. If an element is present in all three lists, it can be added to a new set or list to store the common elements.

For example:

{80, 20}

Time complexity: O(n), where n is the size of list1.
Auxiliary space: O(m), where m is the size of the set of common elements

Method 3: Here is another approach using list comprehension and the intersection method of sets:

[80, 20]

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

Method 4: Use a loop to iterate over the elements of one list and check if they exist in the other two lists. Here’s an example:

[20, 80]

Time complexity: O(n^2), where n is the length of the largest input list.
Auxiliary space: O(m), where m is the size of the resulting list.

Method 5: Using the built-in function filter() and lambda function to find the intersection of the arrays.

• Define a lambda function that takes an element as an argument and checks if it is present in all three arrays.
• Use the filter() function to apply the lambda function to each element of the first array and return only those elements that satisfy the condition.
• Convert the filtered result into a list and return it as the intersection of the three arrays.

[20, 80]

Time complexity: O(n) where n is the length of the first array (assuming constant time set lookup and set intersection operations).
Auxiliary space: O(m) where m is the number of elements that are common in all three arrays (assuming worst-case scenario where all elements are common).