fix: resolve the reviwer comments

Author: jamallaqdiem

Sprint-1/JavaScript/findCommonItems/findCommonItems.js

@@ -1,19 +1,19 @@
 /**
  * Finds common items between two arrays.
  *
- * Time Complexity:O(1)
- * Space Complexity:O(n+m)
- * Optimal Time Complexity:O(1)
+ * Time Complexity:O(n*m)
+ * Space Complexity:O(u)
+ * Optimal Time Complexity:O(n+m)
  *
  * @param {Array} firstArray - First array to compare
  * @param {Array} secondArray - Second array to compare
  * @returns {Array} Array containing unique common items
  */
 export const findCommonItems = (firstArray, secondArray) => {
-  const secondArr = new Set(secondArray);
+  const allowedItems = new Set(secondArray);
 
   const uniqueValues = [
-    ...new Set(firstArray.filter((item) => secondArr.has(item))),
+    ...new Set(firstArray.filter((item) => allowedItems.has(item))),
   ];
   return uniqueValues;
 };

Sprint-1/JavaScript/hasPairWithSum/hasPairWithSum.js

@@ -1,8 +1,8 @@
 /**
  * Find if there is a pair of numbers that sum to a given target value.
  *
- * Time Complexity:O(n)
- * Space Complexity:O(n)
+ * Time Complexity:O(n^2)
+ * Space Complexity:O(1)
  * Optimal Time Complexity:O(n)
  *
  * @param {Array<number>} numbers - Array of numbers to search through
@@ -14,7 +14,6 @@ export function hasPairWithSum(numbers, target) {
 
   for (let num of numbers) {
     const complement = target - num;
-    console.log(complement);
     if (seen.has(complement)) {
       return true;
     }

Sprint-1/JavaScript/removeDuplicates/removeDuplicates.mjs

@@ -1,7 +1,7 @@
 /**
  * Remove duplicate values from a sequence, preserving the order of the first occurrence of each value.
  *
- * Time Complexity:O(n)
+ * Time Complexity:O(n^2)
  * Space Complexity:O(n)
  * Optimal Time Complexity:O(n)
  *

Sprint-1/Python/find_common_items/find_common_items.py

@@ -9,8 +9,8 @@ def find_common_items(
     """
     Find common items between two arrays.
 
-    Time Complexity: O(n+m)
-    Space Complexity:O(n+m)
+    Time Complexity: O(n^3)
+    Space Complexity:O(u)
     Optimal time complexity: O(n+m)
     """
 

Sprint-1/Python/has_pair_with_sum/has_pair_with_sum.py

@@ -7,8 +7,8 @@ def has_pair_with_sum(numbers: List[Number], target_sum: Number) -> bool:
     """
     Find if there is a pair of numbers that sum to a target value.
 
-    Time Complexity:O(n)
-    Space Complexity:O(n)
+    Time Complexity:O(n^2)
+    Space Complexity:O(1)
     Optimal time complexity:O(n)
     """
     seen = set()

Sprint-1/Python/remove_duplicates/remove_duplicates.py

@@ -7,7 +7,7 @@ def remove_duplicates(values: Sequence[ItemType]) -> List[ItemType]:
     """
     Remove duplicate values from a sequence, preserving the order of the first occurrence of each value.
 
-    Time complexity:O(n)
+    Time complexity:O(n^2)
     Space complexity:O(n)
     Optimal time complexity:O(n)
     """