Optimize find_common_items function using set

Author: PratiAmalden

Sprint-1/Python/find_common_items/find_common_items.py

@@ -10,20 +10,10 @@ def find_common_items(
     Find common items between two arrays.
 
     Areas of inefficiency in original version:
-    - Nested loops compare every element in first_sequence to every element
-    in second_sequence (O(n * m)).
+    - Nested loops -> O(n * m)
 
     Time Complexity: O(n + m) avrage
-    Space Complexity: O(m + k)
+    Space Complexity: O(n + m)
     Optimal time complexity: O(n + m)
     """
-    second_set = set(second_sequence)
-    common_items: List[ItemType] = []
-    seen = set()
-
-    for item in first_sequence:
-        if item in second_set and item not in seen:
-            seen.add(item)
-            common_items.append(item)
-
-    return common_items
+    return list(set(first_sequence) & set(second_sequence))