clarified explanation

Author: Droid-An

Sprint-1/JavaScript/findCommonItems/findCommonItems.js

@@ -1,7 +1,7 @@
 /**
  * Finds common items between two arrays.
  *
- * Time Complexity: O(n*m) where n and m are length of each array
+ * Time Complexity: O(n*m) or O(n^2) where n and m are length of each array
  * Space Complexity: O(n) where n is a length of arrays
  * Optimal Time Complexity: O(n)
  *
@@ -14,6 +14,7 @@ export const findCommonItems = (firstArray, secondArray) => {
   // program flow:
   // firstArray.filter go through the each item in first array (loop)
   // secondArray.includes check if that item is in the second array (nested loop)
+  // then, from new filtered array we create a Set which is not a nested array, but still O(n) operation
   // nested loop result in O(n^2) time complexity
 
   // to reduce time complexity to sublinear on the number of elements in the arrays we can use Set and it's .intersection() method

Sprint-1/Python/remove_duplicates/remove_duplicates.py

@@ -23,7 +23,7 @@ def remove_duplicates(values: Sequence[ItemType]) -> List[ItemType]:
     #         unique_items.append(value)
 
     # return unique_items
-    # nested array O(n^2) complexity
+    # nested array - O(n^2) complexity
 
-    # here we iterate through the array to make a dict which is O(n) and than convert it to the list which is also 0(n)
+    # here we iterate through the array to make a dict which is O(n) and than convert it to the list which is also O(n)
     return list(dict.fromkeys(values))