Updating comment.

The complexity of the original code was 0( n x m) because for every item in the first_sequence was compared against every item in second_sequence.
With the new implementation the time complexity is 0(n + m), because one iteration is made to build second_set; then another iteration through first_sequence.

Author: Emilianouz

Sprint-1/Python/find_common_items/find_common_items.py

@@ -8,10 +8,14 @@ def find_common_items(
 ) -> List[ItemType]:
     """
     Find common items between two arrays.
+        
+    The complexity of the original code was 0( n x m) because for every item in the first_sequence was compared against every item in second_sequence.
+    With the new implementation the time complexity is 0(n + m), because one iteration is made to build second_set; then another iteration through first_sequence.
 
     Time Complexity: The time complexity is O(n + m) 
     Space Complexity: The space complexity is O(n + m) 
     Optimal time complexity: The time complexity is O(n + m) 
+    
     """
     second_set = set(second_sequence)
     seen = set()