refactor(algorithms): three sum

BrianLusina · BrianLusina · commit 6e55c5d97f5c · 2025-01-09T11:27:00.000+03:00
diff --git a/algorithms/two_pointers/three_sum/README.md b/algorithms/two_pointers/three_sum/README.md
diff --git a/algorithms/two_pointers/three_sum/__init__.py b/algorithms/two_pointers/three_sum/__init__.py
@@ -4,13 +4,17 @@
 def three_sum(nums: List[int]) -> List[List[int]]:
     """
     Complexity Analysis:
-    Time Complexity: O(nlogn) + O(n^2) = O(n^2) the O(nlogn) is due to sorting
+
+    Time Complexity: O(nlog(n)) + O(n^2) = O(n^2) the O(nlog(n)) is due to sorting
     Space Complexity: O(1) as no extra space is taken up
-    @param nums: input list of integers
-    @return: lists of lists of integers
+
+    Args:
+        nums (list): input list of integers
+    Return:
+        list: list of lists of integers
     """
     result = []
-    # Time Complexity: O(nlogn)
+    # Time Complexity: O(nlog(n))
     nums.sort()
 
     for idx, num in enumerate(nums):
diff --git a/algorithms/two_pointers/three_sum/test_three_sum.py b/algorithms/two_pointers/three_sum/test_three_sum.py
@@ -1,6 +1,6 @@
 import unittest
 
-from algorithms.arrays.three_sum import three_sum
+from algorithms.two_pointers.three_sum import three_sum
 
 
 class ThreeSumTestCases(unittest.TestCase):
